#2 #10 TLE

P1309 [NOIP2011 普及组] 瑞士轮

@[zLyLg](/user/782718) ``` #include<bits/stdc++.h> #define reg register #define gc getchar using namespace std; template<typename T> inline void read(T &x) { x=0;char ch=gc(); while(ch<'0'||ch>'9') ch=gc(); while(ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+ch-48,ch=gc();} } template<typename T> inline void write(T x) { if(x>9) write(x/10); putchar(x%10^48); } int n, r, q; struct whole { int score; int w; int id; }a[200005]; bool operator <(const whole &a,const whole &b){return (a.score^b.score)?a.score>b.score:a.id<b.id;} signed main() { read(n),read(r),read(q);n <<= 1; for(reg int i = 1; i <= n; i++) read(a[i].score), a[i].id = i; for(reg int i = 1; i <= n; i++) read(a[i].w); sort(a + 1, a + 1 + n); while(r--) { for(reg int i = 1; i <= n; i += 8) { a[i].w > a[i + 1].w ? a[i].score++ :a[i + 1].score++; a[i+2].w > a[i + 3].w ? a[i+2].score++ :a[i + 3].score++; a[i+4].w > a[i + 5].w ? a[i+4].score++ :a[i + 5].score++; a[i+6].w > a[i + 7].w ? a[i+6].score++ :a[i + 7].score++; } sort(a + 1, a + 1 + n); } write(a[q].id); return 0; } ``` 卡过去了 https://www.luogu.com.cn/record/148859313
by ilibilib @ 2024-03-01 16:46:43


qwp? @[ilibilib](/user/1039659)
by Litter_Yin @ 2024-03-01 21:49:52


|