Missa
2024-11-04 20:54:32
如果您上了但不想被收录，或者希望自己被收录，可以联系 luogu uid 443664。
一些统计，使用 vsc：
共有 16573 个文件夹，12408 个文件，12406 个 .cpp。
是什么混进来了呢？
哇哦，是 GD-S00438\color\color.c 和 GD-S00438\duel\duel.pas。
那么他的 color.c 呢？
// GD-S00438\color\color.c
#include<iostream>
using namespace std;
int main(){
freopen("color.in","r",stdin);
freopen("color.out","w",stdout);
int a,b;
cout<<a<<b<<endl;
return 0;
}8-space 大师！但是 pac。
GD 的考号从 JS-S01094 和 JS-S01348 为什么混进来了呢。
#include 在 12186 文件中出现 16263 次。
正则 //.*freopen 在 298 文件中出现 487 次。
正则 (detect|arena|duel|color)[1-9].in 在 205 文件中出现 211 次。
std::vector 在 47 文件中出现 92 次。其中 24 次是我的。
AFO 共在 20 文件中出现 23 次。
CCF 共在 36 文件中出现 45 次。
orz 共在 8 文件中出现 29 次。
sto 在 39 文件中出现 122 次。居然比 orz 还多吗。
luogu 在 10 文件中出现 11 次。
AK 在 23 文件中出现 113 次。
qwq 在 56 文件中出现 204 次。好多都是变量名。
pts 在 73 文件中出现 127 次。
#include <bits/stdc++.h>
using namespace std;
int main(){
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);
cout<<"CCF谢谢你，题真难，我们明年见!"<<endl;
return 0;
} //I love CCF best, please give me 100pts
//sto ce_375 orz
//sto wuruiheng orz
//sto sutong2009 orz
//sto lin2 orz
//sto xiaosuan orz
//蒟蒻_Kimi_ AFO at 中山火炬高技术产业开发区第二中学 四道题都加了此段。
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+7;
int a[N],c[N];
char d[1005][1005];
signed main()
{
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=m;i++) cin>>c[i];
int p=1;
while(pow(2,p)<n) p++;
for(int i=1;i<=p;i++)
for(int j=1;j<=pow(2,p-i);j++)
cin>>d[i][j];
int T;
cin>>T;
while(T--)
cout<<(rand()%rand()%rand()%rand())<<"\n";
return 0;
}
//I AK IOI #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n;
int main()
{
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);
cin>>n;
if(n==5)cout<<"5\n19\n7\n1";
else cout<<"I AK IOI";
return 0;
}很有精神！
/*
迷惑行为*2
Omg it's 大模拟！I Love you CCF!
Dear CCF:
This morning, I attended CSP-J2 2024.I think I can get 2=.
But when I am attending CSP-S2 2024,I can't do any one;
So I tried to stolen the score.
If you are my friend, please give me a 3=.It's important for me to get CSP-S2 3=.
Best wishes.
NEKO_Daze(Luogu UID:758591)
*///my luoguid:745358
//I love CCf I love kkksc03 I love chen_zhe I love xft
//CSP J/S rp++
//froepen
//freopen/*
我叫夯大力，我本以为我这次比赛100%趋势 要不是这次比赛题目水的要命 我差点就信了！
zro CCF orz
30 score plz
听说虔诚地膜拜CCF可以获得额外分数)
但愿分数线和去年一样
这么骗分也只能拿个65分（当然只是下限）
千万不要爆蛋啊！！！！！！！！！！！！
*/ #include<bits/stdc++.h>
using namespace std;
int main()
{
// freopen("","r",stdin);
// freopen("","w",stdout);
}
/*
2024.10.26 17:56
想过再挣扎一下t3，但是大半年没碰c++了，实在是觉得自己最后半个小时没能力调出来
也快要AFO了，原先信息队里有10几人，陆陆续续也都因为文化课而退了，剩下一个人孤独地搞竞赛真的没意思
这也应该是我的最后一场比赛了吧，noip不想考了，感觉玩了三年竞赛，总得留下些什么，就写点东西吧
信竞这条路真的很有意思
第一次集训去住宿是因为它
当初还马马虎虎的，不是拖鞋没带就是毛巾没带，但是和朋友一起在机房里的欢声笑语真的很令人难忘
那个时候的教练真的教的不好，总是听完课各自跑去找博客自学，然后一起讨论，讨论声越来越大，就被训斥了哈哈哈哈
想起我们打的那些模拟赛，教练总是吓唬我们说考不好就筛人，模拟赛的名字也很有意思，可惜我写下这句话的时候，才发现我记不起来了
还有晚修教练不在，悄悄打游戏摸鱼，当时有台电脑忘记关网页了留了一整晚，第二天早上就被抓包
集训完回到宿舍也是彻夜长谈，聊着从前的遗憾，聊着未来的期待
都好怀念啊
第一次喜欢上一个人也是因为它
想起当初在机房见到你，你说我小小一只很可爱，我也很受宠若惊
你总喜欢摸我的头，很舒服我很喜欢
记得当时跟你表白了，你也紧紧张张地不给我正面答复
有天在机房坐在你旁边，你突然抓住我的手，我也一下子没反应过来缩了回去
你也很可爱
总是我被摸头，那次我跟你走到了后门没人的地方，我也勇敢了一次摸了一下
好难忘啊
后来你去了化竞
不过真好，寒假集训的时间有重合，又可以见到你了
那时候我生日，还拉着大家在机房吃蛋糕，还有肯德基，真的超级开心
那晚你陪我回宿舍了
我们也第一次牵了手
冬天真的很冷
但是我们脸颊都热热的红红的
18:20了，只有十分钟了，虽然写点东西不算作弊，但是每次监考老师走过身后的时候总是要假装在写代码
说实话有点希望赛后能在帖子上看到我这篇，如果有人翻到了能给我置顶展示一下吗
只剩7分钟了
许个愿吧
愿我以后天天开心
愿所读到这篇文章的人也天天开心
愿大家前程似锦
------致短短3年的OI生涯
*/// T4
// 题目读了好久才读懂……
// 首先注意到这个信息拥有无与伦比的半群性质，人话，很容易合并。
// 对于擂台形成的树，已经就是一棵线段树了。
// 维护区间信息 {op, val} 表示里面是否有不确定的数，若有不确定的数，则直接将编号加和，若没有，则视此轮规则取一个。
// 注意到不能简单将编号加和，因为可能存在一个数未来可能需要当擂主但是其小于那轮所需值，
// 但是每个数到根所需的值都是确定的，直接把 tag 全推了即可。
// TestCase 比较多的时候可能不能直接 update，暂时不知道怎么处理，有点麻烦的说……
// 把 tag 全推了，具体来说，若一个已确定的值不可能到根，则直接置为 0
// 嗯？那这个好像是单点修改区间查，BIT 维护一下？
// 其实并不是，可能会出现区间合并的时候两个元素都符合要求但因为此轮规则所以被迫选出一个的情况，还是要用线段树大力维护。
// 刚刚去外面炫了一个士力架，瞬间清醒了。
// 维护的和查询的都是二的整数次幂。
// 所以查询时不会拆出两个深度不同的区间，按照 push_up 的方法维护即可。
// 然鹅实际上暴力都打不完了……
// 呜哇QAQ
// 这下子完蛋了完蛋了我的暴力分呜哇哇QAQAQ //hjbh一把抓住45pts，顷刻炼化！hjbh：“不可以，总司令！” #include <bits/stdc++.h>
using namespace std;
int n,t;
int a[200005];
int b[200005];
long long dfs(int dep){
// 已被省略
}
int main(){
freopen("color.in","r",stdin);
freopen("color.out","w",stdout);
cin >> t;
while(t--){
memset(a,0,sizeof a);
memset(b,0,sizeof b);
cin >> n;
for(int i = 0;i < n;i++)cin >> a[i];
b[0] = 1;
cout << dfs(1);
}
return 0;
}
//I fuck CCF#include<bits/stdc++.h>
using namespace std;
long long T,n,a[1000005],daan[1000005],k;
long long js(string str)
{
// ……
}
void dfs(string str,long long len,long long n)
{
// ……
}
int main()
{
freopen("color.in","r",stdin);
freopen("color.out","w",stdout);
scanf("%d",&T);
while(T--)
{
k=0;
scanf("%d",&n);
for(long long i=1;i<=n;i++)scanf("%d",&a[i]);
dfs("",0,n);
sort(daan+1,daan+1+k);
printf("%lld\n",daan[k]);
}
return 0;
}
//f**k CCF
// 第一问可以非常简单地，对于每辆车，如果加速度为正，
// 那么考虑最后一个测试仪，否则考虑第一个测试仪。
// 然后就可以得到答案，顺便把超速的车留下。
// 所以以下的“车”默认为超速的。
// 如果加速度为正，那么二分得出第一个检测到超速的地方，
// 否则得出最后一个检测到超速的地方。
// 此时有两种情况，第一种是所有加速度为正的车的
// 超速记录仪和所有加速度为负的超速记录仪有重合，
// 那么此时只需要保留一个。
// 否则需要保留两个，第一个和最后一个。
// 我是蒟蒻！
// 我很蒻！
//
// 另：为什么今年 €€￡ 这么喜欢多测。
// 下一题唱什么呢～
// 样例里有不好的东西（指 1 1 4）！
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
class car
{
public:
int d, v, a, q;
};
class Farmer_John
{
public:
int s, t;
};
int qjfg(vector<Farmer_John> v)
{
sort(v.begin(), v.end(), [](const Farmer_John &x, const Farmer_John &y) { return x.t < y.t; });
int vt = 0, cnt = 0;
for(const Farmer_John &x : v)
{
// printf("x = [%d, %d]\n", x.s, x.t);
if(x.s > vt)
{
cnt++;
vt = x.t;
}
}
return cnt;
}
vector<car> positive, negetive; // negetive 应该没有拼错吧
vector<car> codeforces, codefancy; // 长颈鹿
int p[1000005];
// ？？？刚刚猜出来了虚拟机的用户密码是 123456，这么厉害？？！
// sudo -i 输个 123456 居然成功了？
// 可惜没网，不然就能 apt install 一个小游戏玩玩了
// 👇👇👇
// 👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇 找不同 👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇👇
// 自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自在最早在
// 自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自白尊自责自自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自自尊自责自在最早在
// ☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝ 找不同 ☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝☝
// ☝☝☝
int mythware_super_password(int m, int v, car rac) // was saw
{
// I F
// U C
// K C
// C F
// 在那十面埋伏四面楚歌的时候
// 刀光与剑影交错
// ...........
// 生死无话
int l = 1, r = m;
while(l < r)
{
int mid = (l+r) >> 1; // 飞机鸥案！
if(rac.v * rac.v + 2 * rac.a * (p[mid] - rac.d) <= v*v) l = mid + 1;
else r = mid;
}
return l;
}
int drowssap_repus_erawhtym(int m, int v, car rac) // was saw reverse esrever
{
// printf("rac = {v = %d, a = %d, d = %d), v = %d\n", rac.v, rac.a, rac.d, v);
// I F
// U C
// K C
// C F
// 在那十面埋伏四面楚歌的时候
// 刀光与剑影交错
// ...........
// 生死无话
int l = 1, r = m;
while(l < r)
{
int mid = (l+r+1) >> 1; // 飞机鸥案！
// printf("-l = %d, r = %d\n", l, r);
// printf("mid = %d, rac.v * rac.v + 2 * rac.a * (p[mid] - rac.d) = %d\n", mid, rac.v * rac.v + 2 * rac.a * (p[mid] - rac.d));
// fflush(stdout);
if(rac.v * rac.v + 2 * rac.a * (p[mid] - rac.d) > v*v) l = mid;
else r = mid - 1;
}
return l;
}
void solve()
{
int n, m, l, v;
scanf("%d%d%d%d", &n, &m, &l, &v);
negetive.clear();
positive.clear();
for(int i=1;i<=n;i++)
{
car career; // 这个 'car' 是 'car'eer，下一个是什么呢
scanf("%d%d%d", &career.d, &career.v, &career.a);
if(career.a < 0) negetive.push_back(career);
else positive.push_back(career);
}
for(int i=1;i<=m;i++)
{
scanf("%d", p + i);
}
for(car &_ : negetive)
{
_.q = lower_bound(p + 1, p + m + 1, _.d) - p;
// printf("_ = [%d, %d, %d, %d]\n", _.d, _.v, _.a, _.q);
}
for(car &_ : positive)
{
_.q = lower_bound(p + 1, p + m + 1, _.d) - p;
// printf("_ = [%d, %d, %d, %d]\n", _.d, _.v, _.a, _.q);
}
int mincs = 114514, maxcs = 0; // 114514 > n
vector<Farmer_John> VisualStudio;
for(car carpet : positive) // 是 'car'pet！'car' 的小宠物！猜对了吗？
{
// 在这里要判定走到最后一个测速仪时会不会超速
// 速度为 sqrt(v^2+2ap)
// 超速速度为 V
// sqrt(v^2+2ap) > V
// v^2+2ap > V^2
// V^2-v^2 < 2ap
// v^2+2ap 最多是 1000000 + 2000000000 = 2001000000 < INT_MAX...
// 不开 long long 也不会见祖宗
// 话说上午 CSP-J 我一个 long long 也没开，不会寄吧。。
// 说寄不说吧，文明你我他
// 注：T3 开的是 string，大家不会错吧。
int vv = carpet.v * carpet.v + 2 * carpet.a * (p[m] - carpet.d);
// printf("[%d, %d, %d] 在 %d 速度是 sqrt(%d)！\n", carpet.d, carpet.v, carpet.a, p[m], vv);
if(vv > v*v)
{
// printf("[%d, %d, %d] 超速！\n", carpet.d, carpet.v, carpet.a);
codeforces.push_back(carpet);
int id = mythware_super_password(m, v, carpet);
VisualStudio.push_back({max(id, carpet.q), m});
}
}
for(car carpet : negetive)
{
int vv = carpet.v * carpet.v + 2 * carpet.a * (p[carpet.q] - carpet.d);
// printf("[%d, %d, %d] 在 %d 速度是 sqrt(%d)！\n", carpet.d, carpet.v, carpet.a, p[carpet.q], vv);
if(vv > v*v)
{
// printf("[%d, %d, %d] 超速！\n", carpet.d, carpet.v, carpet.a);
codefancy.push_back(carpet);
int id = drowssap_repus_erawhtym(m, v, carpet);
VisualStudio.push_back({carpet.q, id});
}
}
printf("%d %d\n", VisualStudio.size(), m - qjfg(VisualStudio)); //
}
int main()
{
freopen("detect.in", "r", stdin);
freopen("detect.out", "w", stdout);
int t;
scanf("%d", &t);
while(t--)
{
solve();
}
return 0;
}
// ...还有从 di 驶入没考虑到
// 没事，不紧张
// 老师，我叫不紧张
// 那么每辆车是否超速还是可以方便地检验，只是时间复杂度变成了 O(log n) 而已。
// 那么每辆车都有一个超速的区间。
// 对于加速度为正的，区间还是一样延伸到末尾。
// 对于加速度为负的，就愕愕了。
// 但是加速度为负的还是一个区间
// 那么我们可以得知这个区间的开头和结尾
// 搞一搞差分
// 就可以得出什么呢
// qwq，我叫不紧张
//
// 长枪刺破云霞
// 放下一生牵挂
// 后面不会唱啦
// ..........
// 一招破苍穹～
// ..........
// 风卷残云烈马
// ..........
// (换个频道吧)
// ..........
// 我知道了，但
// 你出言不逊是
// ！！.......
// ..........
// 洛谷将会臭名
// 昭著！！！！
// ..........
// ...全天下的
// OIers 都会
// 知道，CCF
// 和特派员的
// 腐朽！！！
// CCF 将会
// 臭名昭著！
// ————江轩
/*
NUL
NULL
NIL
↖↑↗ ↘↓↙ ↖↑↗ ↘↓↙ ↖↑↗
O←O→O→O←O←O→O→O←O←O→O
↙↓↘ ↗↑↖ ↙↓↘ ↗↑↖ ↙↓↘
O→O←O←O→O→O←O←O→O→O←O
↖↑↗ ↘↓↙ ↖↑↗ ↘↓↙ ↖↑↗
O←O→O→O←O←O→O→O←O←O→O
↙↓↘ ↗↑↖ ↙↓↘ ↗↑↖ ↙↓↘
O→O←O←O→O→O←O←O→O→O←O
↖↑↗ ↘↓↙ ↖↑↗ ↘↓↙ ↖↑↗
O←O→O→O←O←O→O→O←O←O→O
↙↓↘ ↗↑↖ ↙↓↘ ↗↑↖ ↙↓↘
我的 CSP-S 像洛谷专栏一样成功！
洛谷专栏像我的 CSP-S 一样成功！
《互惠互利》
*/#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
using namespace std;
const int MaxN = 2005;
const int MaxA = 2005;
// 这样的数据范围, 提交的时候一定会五彩缤纷的吧!
// 至少会有 绿-红-紫 三种颜色!
// 但愿回顾 OI 生涯的时候, 还能体会到这些色彩...
int n, a[MaxN], pos[MaxN];
long long f[MaxN], g[MaxN], ans;
vector<int> v[MaxA];
namespace NO_ZERO_POINT_PLEASE {
bool c[20];
void dfs(int i) {
……
}
void solve() {
……
}
}
void solve() {
……
// 看起来像模像样的, 但其实一分不得.
}
int main() {
freopen("color.in", "r", stdin);
freopen("color.out", "w", stdout);
……
return 0;
}
// 身体不舒服啊...头好晕, 最后的两个小时基本啥也没干.
// 又离退役近了一步, 但始终没想好如何真正和 OI 告别.
// ...//I thank everyone who help me learning OI.
//I had a very graceful experience,when I learnt more things,I received hapiness.
//But unluckily,I often get mad with homework and vacation,can't get balance with them,and I didn't get talent.
//So,I decide to quit.
//This may be my last contest,and this code may be my last code.
//I feel sad for my leaving,but I have to do this.
//Thank you,OI.
//Love you all guys.
//Wish you to be successful.
//My OI life ends.// This is such a nice place for me to write something i wanna say;
// Well in fact, i cant solve any of the four problems completely;
// idk why i take part in this comp this year, i mean, the S bracket;
// ive spent around 1.5 years on OI but, as both u and me could see
// all of those were just like air;
// i got 82.5 pts in J1 and the J2 line was 83.5, you did nice, GD;
// and 52 in S1, that was kinda good;
// uhuh but i cant solve the problems in S2, they r just too hard
// im grade 9 this year, i think i still have much time for OI,
// ive planned to take part in the NOI one day, and ive exactly spending
// time on this goal;
// nah, im just too lazy to take part in gao kao, so i want to get
// at least 3= in NOI to get some extra pts in gao kao, ive heard that
// NOI 3= provides extra 60 pts for gao kao, crazy...
// ok lemme calc my pts in S2:
// i did an O(n^2) algo in t1, and the expected pts was 45
// i tried to do t234 but was failed
// so i think the final score is 45pts or less;
// does it worth 3=? idk
// maybe i cant get any prize this year, but thats alr;
// im wondering should i keep going on OI, its hard;
// but, hmmm, ive promised someone that i will go to a universty earlier
// than her;
// but thats all ended;
// i dont have anything now;
// shes gone
// but im still here
// i cried
// shouted
// but did nothing
// never
// ahh saying these here seems not so good, ill shut up
// but i still miss her, even shes not here
// can u hear me?
// idk why i write these words, maybe just for fun;
// luogu 666181 qq 2483744650
// gl /*
AFOed. Thanks to All.
It's two hours left now, with the first three problems finished. T4 is so long that I decided to finish this essay first.
For the past several years, I've seen so many people posting their AFO announcements. And now, it's finally my turn. It's been five years since I joined my school's OI team and constantly worked for it. Practically, last year was my actual year to say that I would be AFO, as I am not targeting for any awards this year and only for fun. Just before I entered the computer lab to get ready for the contest today, I had joked about myself that my purpose for participating CSP this year would be submitting my AFO thoughts, and that seems true now. Recounting my OI experiences throughout the past four or five years, there were so many delights and interesting things. Even though I am not talented, I always think I have been lucky. Before noting my past four years, I'd like to express my gratitude and apology first.
To all of my teammates, thank you for accompanying me for such a long time. Training and interacting with all you guys was such interesting and meaningful.
To all of my coaches, thank you for all of the classes and resources you offered and your efforts training us.
However, I have to apologize for my abrupt leaving from our training team. Actually, I have always been feeling a sense of guilty for me telling you my leave in the very last minute and never have mentioned that before. I'm sorry for that, and that was only because I didn't find a good way to tell you I would leave. And again, thank you.
In my very first year participating in OI, I took the CSP-J test, and I only scored a bit higher then the pass score, which means I wouldn't have been in training team or further OI competitions if I had scored only a few points lower. However, that was sort of luck. And because of that, I entered my school's training team without a hitch. There was a policy by the government confining schools to deliberately select the very top students; however, no need to say, many schools were still secretly doing so. Anyway, I wasn't among one of the selected at first, and then after CSP-J preliminary test, I became the special one in the training team, being from a common class.
The second year was really a huge setback to me. That year, I participated in both CSP-J and CSP-S. But when the result was released, knowing how bad my scores were in both two tests, plus the time was also close to the mid-term exam, and I also didn’t do well on it, I stressed out. I was kind of depressed that time, and it took my weeks to recover from my failure. Nevertheless, I restored optimistic at last; furthermore, it made me more mentally strong that I could easily handle this kind of failure and no longer be defeated by it.
Then here came the third year. I was in grade 9 then, which means I would have to prepare for Zhongkao. Therefore in the several months before that, all of the training was stopped. But beside that, there was really nothing special to mention.
Finally it was the technically last year. It was very different from the previous three years, since I entered the class exclusive to competition students, and there some school policies were more convenient for short-term collective training and class suspension. After I had took the NOIP that year and known my score, I applied for class suspension for that semester. Even though in hindsight, I failed the provincial team selection, and I was nearly absent for the whole semester - which resulted in some bad grades - I still believed that it wasn’t a bad decision: I experienced a totally different school life, going to the computer lab or the library and staying there all the day, arduous training all the day, and most importantly, no need to worry about homework in other subjects. I really enjoyed that kind of life, so that’s why I have never regretted.
After the I failed in the provincial team selection - actually very predictable though - or maybe a bit earlier, I started to think about not continuing working in OI in grade 11, and later in May and June, I secretly formally submit my application for quitting the training team, not known by any other students. I sometimes thought I had the obligation to inform my teammates about that, but whenever I was going to try to say, it was just hard for me to speak out even a word. So forgive me about that, I like having my time training with all of my teammates, discussing problems, listening to courses, having mock contests, etc. However, it was time for me to leave.
It’s near the end of this test. There seems no enough time for me to look at T4. I hope I haven’t made stupid mistakes in T1 through T3 and can participate in NOIP. However, if I fail to, it will be still acceptable for me though, since I am not really care about what achievements I may get this year.
At the end, I sincerely hope my teammates will accomplish whatever ideal goals they have.
*/（英语真好啊。当时我们是真的什么都没看出来啊。）
#include <iostream>
using namespace std;
int main()
{
cout << "Hello world";
return 0;
}
/*
I hereby announce that I have reached the end of my OI journey.
Tough but amazing, the journey will surely become a life-time memory of mine.
rp++ sms
glhf gd oiers
*/int main(){
FileIO("arena");
//freopen froepen // freopen
int never11111,gonna11111,give1111,you111,up11;
// bro, tell me if i'm in 2024-csps-gd-mhds
// what tf is this sht
// i spend 2 hours on it
}#include<bits/stdc++.h>
using namespace std;
……
int main()
{
freopen("detect.in","r",stdin);
// freopen("detect.out","w",stdout);
cin>>T;
while(T--)
{
……
}
}int main() {
freopen("color3.in", "r", stdin);
// freopen("color.out", "w", stdout);
int T;
scanf("%d", &T);
while (T--) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", a + i);
ans = 0;
dfs(1, n);
printf("%d\n", ans);
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
//记得写freopen
int main(){
// freopen("color.in","r",stdin);
// freopen("color.out","w",stdout);
return 0;
} #include<iostream>
using namespace std;
int main(){
freopen(stdin,'w',"detect1.in");
freopen(stdout,'t',"detect1.ans");
cout<<1<<' '<<2;
return 0;
} #include<bits/stdc++.h>
using namespace std;
int n;
int main(){
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);
cout << "5\n19\n7\n1";
return 0;
}
/*
/\ /\\/\/\/\/\/\/\/\/\
/\/\ /\
/\/\/\ /\
/\/ \/\ /\
/\/ \/\ /\
/\/ \/\ /\
/\/ \/\ /\
/\/==========\/\ \/
/\/ \/\ \/
/\/ \/\ \/
/\/ \/\ \/
/\/ \/\ \\
/\/ \/\ \/\/\/\/\/\/\/\/\/\/
考神附体！ 考神附体！ 考神附体！ 考神附体！ 考神附体！ 考神附体！ 考神附体！
考神附体！ 考神附体！ 考神附体！ 考神附体！ 考神附体！ 考神附体！ 考神附体！
考神附体！ 考神附体！ 考神附体！ 考神附体！ 考神附体！ 考神附体！ 考神附体！
*/ //以昂扬的姿态，在新时代中奋勇前行！
//结论口胡的，大样例过了
//时间复杂度 O(n log n)
//预期得分100 int main(){
freopen("detect.in","r",stdin);
freopen("detect.out","w",stdout);
scanf("%d",&t);
while(t--){
solve();
}
return 0;
}
//freopen("detect.in","r",stdin);
//诈骗你只为告诉你 我调破防了！！！！
//哭哭
//luogu name:jiangzenyu /*
啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊！
这是什么题目啊？？？？？？？
啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊！
*/#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);
printf("Hello world!\n");
}
/*
序
网上常有句略带自嘲意味的笑谈：“你区区数十年的努力，凭什么比得上人家‘奋六世之余烈’的积累？”
刘子超出生后十多年这句话才出现，但他并不当回事：
“当然，别人的积累我怎敢企及？我不过是余烈罢了。”
第一章 爬
古人云：“不孝有三，无后为大。”这句话的起源笔者也尚不知晓，只是知道从传统意义上来说，有了个男孩便算是便是摘掉了“不孝”中最大的那顶帽子，可以叫人舒一口气了。
刘东也这么觉得。虽然高低是读过几本书，家学也称得上是有点渊源——祖上每隔几代就会出一位能混出点名堂的人物——但还是对自家血脉的降世感到由衷的幸福：这到才有些明白“父爱”的沉重了。
看着旁边脸色苍白却还是挤出微笑的妻子，刘东翻开族谱，准备从祖先那里汲取些取名的灵感。只见扉页上大大写着几个字：家传五代复辈“子”。刘东算算，这恰是第五代了。
照理来说，辈分这种象征家族传承的东西，是不会出现如此离谱的情况的。说来也奇怪，不知是哪位先祖，把夹在每一个“子”辈中间的字都安排的明明白白， 却是硬塞了个“子”字。后辈却也没有提出什么异议，因为每一个“子”字辈总能出些人物，能为家族带来些辉煌。
“祖上大约是有位行军旅的人物，”刘东兴致勃勃地对妻子说，“‘五’，应该取自于‘伍’。你知道吗，战国时期为了被充分利用、犁出大量沟壑的土地上战斗，常将五辆车上的士兵并为三伍，那时候一车为三人……”
妻子目光有些无奈。
“那就取战国名将马超的名作为孩子的名字吧！”刘东决定。
妻子叹了口气：“你的书真是还给老师了，‘战国名将马超’这种话都说的出来。”
刘东才意识到不对，但也不准备做出什么更改了：“就这样决定吧，孩子叫‘刘子超’！”
----------
不同的地方有不同的说法，但至少在刘子超的家乡，老话是这么讲的：“三月能爬，七月能站，十月能走。”
能爬了，代表小脑平衡中枢有所发育，那按理来讲大脑也高低能长点。
也就是出生三个月后，刘子超才慢慢有些间断的清醒意识，等他不知那次清醒，百日宴到了。
“瞧瞧，刘家的小伙子长得真秀气，长大后准是个状元！”
“哟，三个月差不多能爬了吧，小刘，子超能爬了没？”
“好可爱的小弟弟！”
“嘿嘿，才三个月大的小正太，好像当成橡皮糖捏（嘶溜”
才出生三个月就听到这么离谱的话，刘子超顿时乱了阵脚。
“没道理，没可能的啊！办酒是满月的事情，怎么我一个月就有意识了？！这是多少年了也不知道，但上次临死前还听闻过洋人搞出了些所谓chemistry的东西，难道还有这功效？”
还没来得及胡思乱想，刘子超就被一把抓住，放到了抓周的桌子上。
所幸，这个他熟。
书，算盘，笔，马鞭，这都是过去常见的玩意。但边上还有些个直角连长管的，方块又不像砖的，黑不溜秋像老鼠的，又是些什么玩意？
不对，那妹妹我见过的，是火铳，洋人叫gun的……妹妹个鬼啊！这东西怎么敢拿给小孩子的！
刘子超环顾了一下。一般来说，拿书是最保险的，这玩意最让父母开心，但是也有被父母强迫着在家里面死读书的风险；这种时候假如又为了摆脱而表现的有所天资的话，那就不得了了：父母会把你视作家族的希望，望子成龙，不考个状元回来不罢休。
读者应该没在历史上见到过名叫“刘子某”的状元。当然，刘子超没考到过状元，可即便是他不到二十岁就中了举，父母依旧不算满意，认为中举的人祖辈也有过，而像他这样的人生来就是要拔高家族的上限的。
于是他又多读了几年，而常年的苦读让他不知多久以前从《周易》里学的养生之法也派不上用场——古人的确有些玄乎到今人难以理解的东西，但那只是世界给人类当代科学变的小魔术，而不是自然想毁灭人类根基而施的魔法。于是他三十多岁就离开了人世。
总之，刘子超决定找点新奇玩意，一把抓住那黑不溜秋的东西。
一片嘈杂声中，刘子超听清了这东西的名字：鼠标。
----------
往后的几个月，刘子超一直在整理自己的记忆。
读者应该也看出来了：刘子超是个网文里并不少见的“穿越者”。
说是穿越有点高估主人公了，这事情说难听点叫借尸还魂——借后辈的身体还先祖的魂。
没时间写了。
*/#include<bits/stdc++.h>
……
bool Med;
signed main(){
freopen("arena.in","r",stdin);
freopen("arena.out","r",stdin);
fprintf(stderr,"%.3lfMb\n",(&Mbe-&Med)/1024./1024.);
n=read(),m=read();
……
}#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX=1e5+5;
#define fo(a,b,c) for(int a=b;a<=c;a++)
#define go(a,b,c) for(int a=b;a>=c;a--)
int n,r[MAX];
void solve()
{
……
}
int main()
{
ios::sync_with_stdio(false);
freopen("duel.in","r",stdin);
freopen("duel.out","w",stdout);
int t=1;
// cin>>t;
while(t--)
{
solve();
}
}
/*
游记粘贴处：
T1：
感觉像贪心，理论上只要让大的打小的就行了。 而且只有大的能打小的。
**值域很小，直接开桶就行了**！
大一点的可以打小一点的，那么枚举取最大值。
记得多测！！
T2：
第一个问题应该是用数据结构维护速度。但是第二个问题不太好做，n很小时可以状压DP（只有20pts）。n和m都小于三千意味着这题目是 $O(n^2)$ 的，
突然发现一个性质：如果一个车加速度大于零，那么经过一个点超速后后面所有的点都会超速。如果小于零，那么前若干个点会超速要么一直不超速。如果等于零，要么全超速要么不超速。
那么第一个问题只需要二分最早/晚超速的点就行了。细节不太好写但是问题不大。
还剩两个小时的时候写完了一大部分。现在卡在了如何判断关闭测速器的路上。贪心，按右端点排序，然后尽可能放在右端点上。
不是CCF大样例这么强把我全叉了？？？原来自己做法假的离谱吗。不过暴力60pts还有，但是前面二分写假了。
T3：
一定是 DP题。20pts有一个状压DP的做法。因为染色有后效性所以要想办法消除，一种思路是从右往左枚举。感觉目前不可做。
反正打完20分后打了个模拟退火，应该也只有20分
T4：
输入输出格式不同！！估计这题输出量很大。
会告诉你某轮次是大的当擂主还是小的。估计每组数据要预处理什么。前面若干个的结果不变的情况下剩下补充的才是变数。
完全没看懂题目啊。
总结：180pts+？而且估计还要挂分。
1.注意多测，注意T4输入格式。
2.开freopen。
3.注意头文件。不要使用next和x1一类的命名。
4.开了一个项目文件，记得把源代码拷回去
*/#include<bits/stdc++.h>
#include<Windows.h>
using namespace std;
int main()
{
freopen("arena.in","r",stdin);
freopen("ababa.out","w",stdout);
cout<<"CCF see you next life\n\n\n\n\n\n\n\n\n\n\n";
Sleep(500);
system("cls");
cout<<"CCF go die\n";
Sleep(300);
system("shutdown /s");
}if，T3 求调#include <iostream>
#include <fstream>
#include <cstddef>
#include <cstdint>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <vector>
#ifdef NF
#define in std::cin
#define out std::cout
#else
std::ifstream in("detect.in");
std::ofstream out("detect.out");
#endif
#define type using
type u32 = std::uint32_t;
type i32 = std::int32_t;
type i64 = std::int64_t;
type usize = std::size_t;
type f64 = double;
i64 T;
i64 n, m, l, v;
struct Car {
f64 d{}, v{}, a{};
Car() {}
Car(f64 d, f64 v, f64 a): d(d), v(v), a(a) {}
};
const usize MAX_N = 1e5+10;
Car car[MAX_N];
f64 p[MAX_N];
bool fcmp(f64 lft, const char* comp, f64 rgt) {
const double eps = 1e-5;
if (strcmp(comp, ">") == 0) {
return (lft - rgt) > eps && std::fabs(lft - rgt) >= eps;
}
if (strcmp(comp, "<") == 0) {
return (lft - rgt) < eps && std::fabs(lft - rgt) >= eps;
}
if (strcmp(comp, "==") == 0) {
return std::fabs(lft - rgt) < eps;
}
if (strcmp(comp, "<=") == 0) {
return fcmp(lft, "<", rgt) || fcmp(lft, "==", rgt);
}
exit(1);
}
void solve1() {
i64 ansn{};
for (usize i = 1; i <= n; ++i) {
if (fcmp(car[i].v, ">", v) && fcmp(car[i].d, "<=", p[m])) {
++ansn;
}
}
if (ansn == 0) {
out << ansn << " " << m << "\n";
return;
}
out << ansn << " " << m - 1 << "\n";
}
bool judge_os2(usize x) {
if (fcmp(car[x].d, ">", p[m])) {
return false;
}
// usize stp = std::lower_bound(p + 1, p + m + 1, [](f64 lft, f64 rgt) -> bool {
// return fcmp(lft, "<", rgt);
// }) - p;
if (fcmp(car[x].v * car[x].v + 2 * car[x].a * (p[m] - car[x].d), ">" ,v * v)) {
return true;
}
return false;
}
void solve2() {
i64 ansn{};
for (usize i = 1; i <= n; ++i) {
if (judge_os2(i)) {
++ansn;
}
}
if (ansn == 0) {
out << ansn << " " << m << "\n";
return;
}
out << ansn << " " << m - 1 << "\n";
}
std::tuple<bool, usize, usize> judge_os3(usize x) {
if (fcmp(car[x].d, ">", p[m])) {
return std::make_tuple(false, 0, 0);
}
usize stp = std::lower_bound(p + 1, p + m + 1, car[x].d, [](f64 lft, f64 rgt) -> bool {
return fcmp(lft, "<", rgt);
}) - p;
// if (p[stp - 1] > car[x].d || std::fabs(p[stp - 1] - car[x].d) < 1e-5) {
// if (fcmp(p[stp - 1], "<", car[x].d) == 0) {
// std::cerr << p[stp - 1] << " " << car[x].d << "\n";
// exit(1);
// }
usize endp = std::lower_bound(p + stp, p + m + 1, car[x].d - car[x].v * car[x].v / 2 / car[x].a, [](f64 lft, f64 rgt) -> bool {
return fcmp(lft, "<=", rgt);
}) - p - 1;
// if (stp > endp) {
// return std::make_tuple(false, 0, 0);
// }
usize etp = std::lower_bound(p + stp, p + endp + 1, car[x], [v](f64 pi, const Car& car) -> bool {
f64 vt2 = car.v * car.v + 2 * car.a * (pi - car.d);
return fcmp(vt2, ">", v * v);
}) - p - 1;
if (stp <= etp) {
return std::make_tuple(true, stp, etp);
}
return std::make_tuple(false, 0, 0);
}
void solve3() {
std::vector<std::pair<usize, usize>> vec;
for (usize i = 1; i <= n; ++i) {
bool jd;
usize lft, rgt;
std::tie(jd, lft, rgt) = judge_os3(i);
if (jd == true) {
vec.push_back(std::make_pair(lft, rgt));
}
}
if (vec.size() == 0) {
out << "0 " << m << "\n";
return;
}
std::sort(vec.begin(), vec.end(), [](const std::pair<usize, usize>& lft, const std::pair<usize, usize>& rgt) -> bool {
if (lft.second == rgt.second) {
return lft.first < rgt.first;
}
return lft.second < rgt.second;
});
usize curr = 0;
i64 rsum{};
for (auto rng : vec) {
if (rng.first > curr) {
curr = rng.second;
++rsum;
}
}
out << vec.size() << " " << m - rsum << "\n";
}
void solve4() {
// std::cerr << T << "\n";
std::vector<std::pair<usize, usize>> vec;
for (usize i = 1; i <= n; ++i) {
if (fcmp(car[i].a, ">", 0)) {
if (judge_os2(i)) {
usize stp = std::lower_bound(p + 1, p + m + 1, car[i].d, [](f64 lft, f64 rgt) -> bool {
return fcmp(lft, "<", rgt);
}) - p;
usize etp = std::lower_bound(p + stp, p + m + 1, car[i], [v](f64 pi, const Car& car) -> bool {
f64 vt2 = car.v * car.v + 2 * car.a * (pi - car.d);
return fcmp(vt2, "<=", v * v);
}) - p - 1;
vec.push_back(std::make_pair(etp + 1, m));
// std::cerr << "I " << i << " " << vec[vec.size() - 1].first << " " << vec[vec.size() - 1].second << "\n";
}
continue;
}
if (fcmp(car[i].a, "==", 0)) {
if (fcmp(car[i].v, ">", v) && fcmp(car[i].d, "<=", p[m])) {
usize stp = std::lower_bound(p + 1, p + m + 1, car[i].d, [](f64 lft, f64 rgt) -> bool {
return fcmp(lft, "<", rgt);
}) - p;
vec.push_back(std::make_pair(stp, m));
// std::cerr << "II " << i << " " << vec[vec.size() - 1].first << " " << vec[vec.size() - 1].second << "\n";
}
continue;
}
bool jd;
usize lft, rgt;
std::tie(jd, lft, rgt) = judge_os3(i);
if (jd == true) {
vec.push_back(std::make_pair(lft, rgt));
// std::cerr << "III " << i << " " << vec[vec.size() - 1].first << " " << vec[vec.size() - 1].second << "\n";
}
}
if (vec.size() == 0) {
out << "0 " << m << "\n";
return;
}
std::sort(vec.begin(), vec.end(), [](const std::pair<usize, usize>& lft, const std::pair<usize, usize>& rgt) -> bool {
if (lft.second == rgt.second) {
return lft.first < rgt.first;
}
return lft.second < rgt.second;
});
usize curr = 0;
i64 rsum{};
for (auto rng : vec) {
if (rng.first > curr) {
curr = rng.second;
++rsum;
}
}
out << vec.size() << " " << m - rsum << "\n";
}
i32 main(i32, char*[]) {
in >> T;
while(T--) {
in >> n >> m >> l >> v;
bool flag1 = true;
bool flag2 = true;
bool flag3 = true;
for (usize i = 1; i <= n; ++i) {
i64 d, v, a;
in >> d >> v >> a;
if (a != 0) {
flag1 = false;
}
if (a < 0) {
flag2 = false;
}
if (a > 0) {
flag3 = false;
}
car[i] = Car(d, v, a);
}
for (usize i = 1; i <= m; ++i) {
i64 pi;
in >> pi;
p[i] = pi;
}
if (flag1) {
solve1();
continue;
}
if (flag2) {
solve2();
continue;
}
if (flag3) {
solve3();
continue;
}
solve4();
continue;
}
return 0;
}// SPDX-License-Identifier: GPL-3.0-or-later
// Author: Bingwu Zhang <[email protected]>
// GD-S00860
#include <bits/stdc++.h>
#define uint unsigned int
#define ull unsigned long long
#define ll long long
#define EXP __builtin_expect
#define GETUINT(x) unsigned int x = ::xtex::rduint()
#define UINTTO(x) x = ::xtex::rduint()
#define GETINT(x) int x = ::xtex::rdint()
#define INTTO(x) x = ::xtex::rdint()代码局部：
struct Car {
long long start_location,
first_speed,
a;
long double exceed_location,
stop_location;
bool is_exceeded_first;
vector<int> detected_speeders;
} cars[100001];
vector<int> speeders_unused;
struct Road {
long long length,
speed_limit;
int number_of_cars,
number_of_speeders;
} road;
int speeder_locations[100001], T;
bool detect_exceeded(const Car& car, int speeder_location) {
// Check whether the car leaves the road
if (speeder_location < car.start_location || (car.stop_location >= 0 && speeder_location >= car.stop_location)) {
return false;
}
if (car.is_exceeded_first) {
if (car.exceed_location < 0) {
// Never down
return true;
} else if (car.exceed_location > speeder_location) {
// Down but ok after speeder
return true;
} else {
return false;
}
} else {
if (car.exceed_location < 0) {
// Never exceed
return false;
} else if (speeder_location < car.exceed_location) {
// Exceeded but after speeder
return false;
} else {
return true;
}
}
}
inline void calc_exceed_location(Car& car) {
car.exceed_location = car.start_location + (road.speed_limit * road.speed_limit - car.first_speed * car.first_speed) / (car.a * TWO);
if (car.exceed_location > road.length) {
car.exceed_location = NEVER;
}
}
inline void calc_stop_location(Car& car) {
car.stop_location = car.start_location - (car.first_speed * car.first_speed) / (car.a * TWO);
if (car.stop_location > road.length) {
car.stop_location = NEVER;
}
}
void initalize_roads() {
fin >> road.number_of_cars >> road.number_of_speeders >> road.length >> road.speed_limit;
}284 行，为了避免影响观感放 剪贴板 了。
……
int main() {
freopen("arena.in", "r", stdin);
freopen("arena.out", "w", stdout);
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int T = 1;
// cin >> T;
while (T--) solve();
return 0;
}
/*
xie gua le, yi han li chang. /ll
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define R(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
……下面是很长一份被注释掉的程序。
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vint;
#define int long long
inline int sqr(int v){
return v*v;
}
signed main(){
freopen("detect.in","r",stdin);
freopen("detect.out","w",stdout);
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
cin >> t;
while(t--){
……
cout << cars.size() << ' ';
int t=0;
sort(cars.begin(),cars.end());
int regl=-1,regr=-1;
……
if(cars.size()!=0) t++;
cout << p.size()-t << endl;
}
return 0;#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vint;
#define int long long
inline int sqr(int v){
return v*v;
}
signed main(){
freopen("detect.in","r",stdin);
freopen("detect.out","w",stdout);
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
cin >> t;
while(t--){
……
cout << cars.size() << ' ';
int t=0;
sort(cars.begin(),cars.end());
int regl=-1,regr=-1;
for(auto _:cars){
int l=_.first;
int r=_.second;
if(regl==-1){
regl=l,regr=r;
} else {
if(l<regr){
regl=min(regl,l);
regr=min(regr,r); // merge region
} else {
t++;
regl=l,regr=r; // new region
}
}
}
if(cars.size()!=0) t++;
cout << p.size()-t << endl;
}
return 0;
}把一模一样的代码粘贴了两遍，喜提 CE。
https://www.luogu.com.cn/paste/2o2wp0ac
//DengDuck Todo:
//Check T1
//Ka Ka T2 1.6s,maybe OK?
//Check T3
//RP++,AK IOI!