ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#229 | #5. 「WyOJ Round 1」炽 · 踏浪而歌 | lgvc | 100 | 1056ms | 5980kb | C++23 | 916b | 2025-04-18 14:13:00 | 2025-04-18 18:00:32 |
answer
#include <bits/stdc++.h>
int N,a[100009],ss[1000009];
signed main(void) {
scanf("%d",&N);
int su=0,ma=0;
for(int i=1;i<=N;i++) {
scanf("%d",&a[i]);
su+=a[i];
ma=std::max(ma,a[i]);
}
int ans=std::max(ma,(su+1)/2);
printf("%d\n",ans);
if(ma<ans&&su%2==1) {
printf("1 1\n");
a[1]--;ans--;
}
for(int i=1;i<=N;i++) {
ss[a[i]]++;
}
while(ma&&ss[ma]==0) ma--;
int p1=1,p2=2;
while(ans>ma) {
while(p1<=N&&a[p1]==0) p1++;
if(p2<=p1) p2=p1+1;
while(p2<=N&&a[p2]==0) p2++;
printf("%d %d\n",p1,p2);
ss[a[p1]]--;
ss[a[p2]]--;
a[p1]--;
a[p2]--;
ss[a[p1]]++;
ss[a[p2]]++;
ans--;
while(ma&&ss[ma]==0) ma--;
}
int id;
for(int i=1;i<=N;i++) {
if(a[i]==ma) {
id=i;
}
}
for(int i=1;i<=N;i++) {
int xx=i,yy=id,va=a[i];
if(i==id) va=2*ma-su;
if(xx>yy) std::swap(xx,yy);
for(int j=1;j<=va;j++) printf("%d %d\n",xx,yy);
}
}
这程序好像有点Bug,我给组数据试试?
详细
小提示:点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 3ms
memory: 3492kb
input:
6 3 4 1 2 4 6
output:
10 1 2 1 2 1 2 2 3 4 6 4 6 5 6 5 6 5 6 5 6
result:
ok 21 numbers
Test #2:
score: 10
Accepted
time: 69ms
memory: 3276kb
input:
1000 1000 1000 1000 999 996 993 991 991 991 991 991 991 988 988 988 988 987 984 980 980 978 978 977 ...
output:
259517 1 1 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1...
result:
ok 519035 numbers
Test #3:
score: 10
Accepted
time: 104ms
memory: 5980kb
input:
5 93761 154479 466694 134030 151036
output:
500000 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1...
result:
ok 1000001 numbers
Test #4:
score: 10
Accepted
time: 140ms
memory: 3572kb
input:
56700 20 9 3 26 6 14 11 26 15 4 7 7 18 3 55 16 0 2 71 8 21 3 15 21 2 25 38 10 2 15 3 1 3 15 6 2 26 5...
output:
500000 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 3 1 3 1 3 1 4 1 4 1 4 1 4 1 4 1 4 1 4 1 4 4 5 4 5 4 5 4...
result:
ok 1000001 numbers
Test #5:
score: 10
Accepted
time: 113ms
memory: 3676kb
input:
18574 19 245 80 2 53 157 18 27 35 19 109 14 30 97 26 10 5 22 142 102 13 114 67 70 142 131 10 177 18 ...
output:
500000 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 2 3 2 3 2 3 2 3 2...
result:
ok 1000001 numbers
Test #6:
score: 10
Accepted
time: 137ms
memory: 5592kb
input:
36045 6 62 19 5 21 38 42 13 52 3 10 4 14 65 24 15 9 21 19 24 1 3 2 59 2 19 80 28 9 39 49 26 20 20 14...
output:
500000 1 2 1 2 1 2 1 2 1 2 1 2 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2...
result:
ok 1000001 numbers
Test #7:
score: 10
Accepted
time: 105ms
memory: 3652kb
input:
100 442 37503 827 703 10394 1215 23599 313 1705 10819 6152 89 341 3448 778 7153 20397 5166 2735 2100...
output:
500000 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1...
result:
ok 1000001 numbers
Test #8:
score: 10
Accepted
time: 114ms
memory: 3504kb
input:
1000 6 436 820 182 327 3272 993 1042 321 2717 69 4321 706 4565 1280 528 1632 1317 916 125 262 1712 6...
output:
500000 1 2 1 2 1 2 1 2 1 2 1 2 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2...
result:
ok 1000001 numbers
Test #9:
score: 10
Accepted
time: 124ms
memory: 3584kb
input:
10000 6 107 38 107 3 28 89 15 30 19 89 2 435 75 45 55 119 125 15 42 101 83 9 134 3 278 292 55 255 2 ...
output:
500000 1 2 1 2 1 2 1 2 1 2 1 2 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2...
result:
ok 1000001 numbers
Test #10:
score: 10
Accepted
time: 147ms
memory: 3664kb
input:
100000 3 3 62 19 5 21 0 17 21 2 1 36 3 11 2 3 10 22 17 3 10 0 4 3 11 20 11 22 12 12 12 1 10 4 9 6 4 ...
output:
500000 1 2 1 2 1 2 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 4 3 5 3...
result:
ok 1000001 numbers
Extra Test:
score: 0
Extra Test Passed