QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #749918 | #8363. interactive | xcc_szy0905 | 10 | 145ms | 5948kb | C++14 | 930b | 2024-11-15 11:23:51 | 2024-11-15 11:23:53 |
Judging History
answer
#include<bits/stdc++.h>
#include "interactive.h"
using namespace std;
const int kmaxn=505;
vector<int>an;
int dm[kmaxn][kmaxn];
int n;
void dfs(int x,int f){
an.push_back(x);
for(int i=1;i<=n;i++){
if(dm[x][i]&&i!=f&&i!=x){
dfs(i,x);
}
}
}
std::vector<int> solve(int N){
n=N;
srand(time(0));
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
dm[i][j]=100;
}
}
vector<int>pr;
for(int i=1;i<=n;i++){
pr.push_back(i);
}
for(int I=1;I<=24000;I++){
random_shuffle(pr.begin(),pr.end());
int op=query(pr);
if(n==3){
if(op==2){
return pr;
}
}
for(int i=0;i<n-1;i++){
int u=pr[i],v=pr[i+1];
dm[u][v]=min(dm[u][v],op);
dm[v][u]=min(dm[v][u],op);
}
}
for(int i=1;i<=n;i++){
int sz=0;
for(int j=1;j<=n;j++){
// cout<<i<<" "<<j<<" "<<dm[i][j]<<"\n";
if(i!=j&&dm[i][j])sz++;
}
if(sz==1){dfs(i,0);return an;}
}
return an;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 10
Accepted
Test #1:
score: 10
Accepted
time: 0ms
memory: 3912kb
input:
1 3 3 1 2
output:
3 4442334 7113
result:
points 1.0
Test #2:
score: 10
Accepted
time: 9ms
memory: 3984kb
input:
1 30 6 28 10 9 13 4 7 1 21 15 20 27 19 5 17 2 22 12 29 23 14 30 18 3 11 24 26 16 8 25
output:
24000 815090619 537621159
result:
points 1.0
Test #3:
score: 10
Accepted
time: 9ms
memory: 3976kb
input:
1 27 24 17 15 3 13 9 6 16 14 22 7 19 25 12 1 26 23 27 10 21 8 5 18 11 20 4 2
output:
24000 815090619 966160455
result:
points 1.0
Test #4:
score: 10
Accepted
time: 9ms
memory: 4276kb
input:
1 29 24 8 7 14 19 20 4 6 1 12 18 2 10 3 23 13 26 11 22 27 9 17 16 5 21 29 25 15 28
output:
24000 815090619 646167394
result:
points 1.0
Test #5:
score: 10
Accepted
time: 9ms
memory: 3984kb
input:
1 30 9 22 10 27 8 5 23 21 2 25 6 13 30 19 17 20 4 14 29 28 24 15 11 7 12 18 26 16 3 1
output:
24000 815090619 904341262
result:
points 1.0
Test #6:
score: 10
Accepted
time: 8ms
memory: 3920kb
input:
1 27 8 6 11 20 24 7 9 25 13 19 2 3 23 15 16 4 22 21 10 18 12 27 14 5 1 17 26
output:
24000 815090619 173992498
result:
points 1.0
Test #7:
score: 10
Accepted
time: 8ms
memory: 3980kb
input:
1 27 2 5 25 13 11 12 23 24 6 18 19 21 15 17 7 10 16 20 22 27 3 4 8 14 26 1 9
output:
24000 815090619 772894146
result:
points 1.0
Test #8:
score: 10
Accepted
time: 8ms
memory: 4260kb
input:
1 27 13 11 10 27 20 23 3 25 12 24 6 2 19 9 7 17 1 5 8 26 14 16 21 15 22 4 18
output:
24000 815090619 181323461
result:
points 1.0
Test #9:
score: 10
Accepted
time: 8ms
memory: 4032kb
input:
1 27 3 15 12 14 18 27 23 6 20 26 21 5 13 19 10 9 11 17 16 4 25 7 24 2 22 1 8
output:
24000 815090619 480249695
result:
points 1.0
Test #10:
score: 10
Accepted
time: 9ms
memory: 3992kb
input:
1 29 23 7 4 10 9 16 1 14 3 17 13 19 15 8 5 22 24 29 11 12 18 25 21 2 28 26 27 20 6
output:
24000 815090619 31142540
result:
points 1.0
Subtask #2:
score: 0
Time Limit Exceeded
Test #11:
score: 90
Accepted
time: 8ms
memory: 3972kb
input:
1 27 17 16 3 20 27 5 2 13 24 21 25 23 19 9 7 4 22 12 26 15 14 11 1 18 6 10 8
output:
24000 815090619 558749364
result:
points 1.0
Test #12:
score: 90
Accepted
time: 9ms
memory: 4284kb
input:
1 29 19 13 20 22 26 1 23 24 3 14 8 25 29 17 10 9 15 11 18 4 2 28 21 7 6 12 16 27 5
output:
24000 815090619 145445666
result:
points 1.0
Test #13:
score: 90
Accepted
time: 9ms
memory: 3980kb
input:
1 28 16 7 19 9 23 12 20 26 4 10 15 8 21 5 1 22 27 2 18 24 28 6 3 14 13 17 25 11
output:
24000 815090619 877668399
result:
points 1.0
Test #14:
score: 90
Accepted
time: 9ms
memory: 3988kb
input:
1 30 13 4 29 25 16 14 6 15 19 28 7 20 3 23 12 17 8 22 1 24 9 30 21 18 2 26 27 10 11 5
output:
24000 815090619 737974315
result:
points 1.0
Test #15:
score: 90
Accepted
time: 9ms
memory: 3988kb
input:
1 27 18 25 15 20 23 14 4 16 27 6 2 12 21 19 17 26 9 8 10 11 3 7 13 22 24 5 1
output:
24000 815090619 590934171
result:
points 1.0
Test #16:
score: 42
Acceptable Answer
time: 140ms
memory: 5852kb
input:
2 494 364 164 445 359 288 412 15 377 91 481 14 3 357 358 269 136 336 106 392 200 50 388 33 338 114 11 266 186 170 239 494 196 395 68 36 423 378 218 342 275 67 240 120 86 134 356 190 323 123 339 187 30 270 430 292 121 372 404 94 143 454 309 461 344 141 480 474 248 199 42 150 260 369 483 493 124 396 4...
output:
24000 815090619 998930322
result:
points 0.46666666670
Test #17:
score: 42
Acceptable Answer
time: 145ms
memory: 5948kb
input:
2 500 468 70 339 65 443 143 75 123 220 163 390 484 489 139 392 147 183 132 202 14 19 380 310 259 179 482 85 36 232 419 285 378 137 274 376 23 321 263 217 485 387 466 94 104 164 57 185 359 42 211 40 206 418 184 458 173 441 291 11 366 428 384 223 190 374 34 275 210 171 226 408 168 88 494 204 66 481 10...
output:
24000 815090619 110390244
result:
points 0.46666666670
Test #18:
score: 0
Time Limit Exceeded
input:
2 500 217 120 312 323 22 113 331 295 315 66 434 181 381 421 154 253 226 100 152 490 389 261 244 249 165 500 4 426 23 487 356 466 364 436 2 374 486 494 420 14 344 34 26 475 279 96 457 493 185 147 227 41 180 61 472 102 76 131 141 164 324 204 403 298 283 284 19 132 258 355 499 183 108 483 348 172 134 2...
output:
Unauthorized output