QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #833094 | #9241. Sphinx | syxsyx | 3 | 1ms | 4116kb | C++20 | 808b | 2024-12-26 13:13:17 | 2024-12-26 13:13:17 |
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int perform_experiment(vector<int> E);
int n,res[N];
int col[N];
int ask()
{
vector <int> E;
E.resize(n);
for(int i=0;i<n;i++) E[i]=col[i];
return perform_experiment(E);
}
int pii[N];
int cnt;
void work(int x)
{
int cnt=1+(n>2);
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++) col[j]=n;
col[x]=-1;
col[pii[x]]=i;
if(ask()==cnt){res[x]=i;return;}
}
assert(0);
}
vector <int> find_colours(int N,vector <int> X,vector <int> Y)
{
n=N;
for(int i=0;i<X.size();i++) pii[X[i]]=Y[i],pii[Y[i]]=X[i];
// for(int i=0;i<n;i++) printf("%d ",pii[i]);printf("\n");
for(int i=0;i<n;i++) work(i);
vector <int> ret;
for(int i=0;i<n;i++) ret.push_back(res[i]);
return ret;
}
/*
4 3
1 0 2 3
0 1
1 2
2 3
*/
详细
Subtask #1:
score: 3
Accepted
Test #1:
score: 3
Accepted
time: 0ms
memory: 3752kb
input:
1978433568 2 1 0 1 1978433568 1 1978433568 1
output:
877694080 -1 0 877694080 0 -1 877694081 0 0
result:
ok #experiments: 2
Test #2:
score: 3
Accepted
time: 1ms
memory: 3804kb
input:
1978433568 2 1 0 1 1978433568 1 1978433568 2 1978433568 1
output:
877694080 -1 0 877694080 0 -1 877694080 1 -1 877694081 0 1
result:
ok #experiments: 3
Test #3:
score: 3
Accepted
time: 1ms
memory: 3844kb
input:
1978433568 2 1 0 1 1978433568 2 1978433568 1 1978433568 1
output:
877694080 -1 0 877694080 -1 1 877694080 0 -1 877694081 1 0
result:
ok #experiments: 3
Test #4:
score: 3
Accepted
time: 0ms
memory: 4116kb
input:
1978433568 2 1 0 1 1978433568 2 1978433568 1 1978433568 2 1978433568 1
output:
877694080 -1 0 877694080 -1 1 877694080 0 -1 877694080 1 -1 877694081 1 1
result:
ok #experiments: 4
Subtask #2:
score: 0
Runtime Error
Dependency #1:
100%
Accepted
Test #5:
score: 0
Runtime Error
input:
1978433568 50 49 0 1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 19784335...
output:
877694080 -1 0 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 877694080 -1 1 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 ...
result:
Subtask #3:
score: 0
Runtime Error
Test #34:
score: 0
Runtime Error
input:
1978433568 250 249 0 1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 49 50 ...
output:
877694080 -1 0 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 2...
result:
Subtask #4:
score: 0
Runtime Error
Test #43:
score: 0
Runtime Error
input:
1978433568 250 31125 0 1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0 9 0 10 0 11 0 12 0 13 0 14 0 15 0 16 0 17 0 18 0 19 0 20 0 21 0 22 0 23 0 24 0 25 0 26 0 27 0 28 0 29 0 30 0 31 0 32 0 33 0 34 0 35 0 36 0 37 0 38 0 39 0 40 0 41 0 42 0 43 0 44 0 45 0 46 0 47 0 48 0 49 0 50 0 51 0 52 0 53 0 54 0 55 0 56 0 57 0 5...
output:
877694080 -1 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250 250...
result:
Subtask #5:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
0%