QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#553215	#9241. Sphinx	fansizhe	20.5	158ms	4860kb	C++20	4.3kb	2024-09-08 10:45:54	2024-09-08 10:45:55

Judging History

你现在查看的是最新测评结果

[2024-09-08 10:45:55]
评测

测评结果：20.5
用时：158ms
内存：4860kb

查看

[2024-09-08 10:45:54]
提交

answer

#include<bits/stdc++.h>
#include"sphinx.h"
using namespace std;
namespace{
    int n,m;
    int mat[255][255];
}
namespace Subtask0{
    vector<int> res;
    int vis[255];
    int fa[255];
    int get(int x){return x==fa[x]?x:fa[x]=get(fa[x]);}
    int ask(vector<int> vec){
        for(int i=0;i<n;i++)if(vec[i]<0)vec[i]=res[i];
        int res=0;
        for(int i=0;i<n;i++)vis[i]=0;
        for(int i=0;i<n;i++)if(!vis[i]){
            res++;
            queue<int> que;
            que.push(i);vis[i]=1;
            while(!que.empty()){
                int x=que.front();que.pop();
                for(int y=0;y<n;y++)if(mat[x][y]&&!vis[y]&&vec[x]==vec[y])que.push(y),vis[y]=1;
            }
        }
        return res;
    }
    vector<int> solve(){
        res.clear();
        res.push_back(0);
        for(int i=0;i<n;i++)fa[i]=i;
        int cnt=1;
        for(int i=1;i<n;i++){
            vector<int> edge;
            for(int j=0;j<i;j++)if(mat[j][i])edge.push_back(j);
            vector<int> vec;
            for(int j=0;j<n;j++)vec.push_back(n);
            vec[i]=-1;
            for(int j:edge)vec[j]=-1;
            int val=perform_experiment(vec);
            vec[i]=n;
            int flag=0;
            for(int j=i+1;j<n;j++)if(mat[i][j])flag=1;
            if(ask(vec)+flag!=val){
                int l=0,r=edge.size()-1;
                while(l<r){
                    int mid=l+r>>1;
                    for(int j=0;j<l;j++)vec[edge[j]]=n;
                    for(int j=l;j<=mid;j++)vec[edge[j]]=-1;
                    for(int j=mid+1;j<edge.size();j++)vec[edge[j]]=n;
                    vec[i]=-1;
                    int val=perform_experiment(vec);
                    vec[i]=n;
                    if(ask(vec)+1!=val)r=mid;
                    else l=mid+1;
                }
                res.push_back(res[edge[l]]);
                vector<int> vv;
                for(int j:edge)if(get(res[j])!=get(res[i]))vec[j]=-1,vv.push_back(j);else vec[j]=n;
                vec[i]=-1;
                int val=perform_experiment(vec);
                vec[i]=n;
                while(ask(vec)+1!=val){
                    l=0,r=vv.size()-1;
                    while(l<r){
                        int mid=l+r>>1;
                        for(int j=0;j<l;j++)vec[vv[j]]=n;
                        for(int j=l;j<=mid;j++)vec[vv[j]]=-1;
                        for(int j=mid+1;j<vv.size();j++)vec[vv[j]]=n;
                        vec[i]=-1;
                        int val=perform_experiment(vec);
                        vec[i]=n;
                        if(ask(vec)+1!=val)r=mid;
                        else l=mid+1;
                    }
                    fa[get(res[vv[l]])]=res[i];
                    vv.clear();
                    for(int j:edge)if(get(res[j])!=get(res[i]))vec[j]=-1,vv.push_back(j);else vec[j]=n;
                    vec[i]=-1;
                    val=perform_experiment(vec);
                    vec[i]=n;
                }
            }else res.push_back(cnt++);
        }
        for(int i=0;i<n;i++)res[i]=get(res[i]);
        return res;
    }
}
namespace Subtask1{
    bool check(){
        if(m>=n)return 0;
        for(int i=1;i<n;i++)if(!mat[i-1][i])return 0;
        return 1;
    }
    vector<int> solve(){
        vector<int> res;
        res.push_back(0);
        for(int i=1;i<n;i++){
            vector<int> vec;
            for(int j=0;j<i-1;j++)vec.push_back(n);
            vec.push_back(-1);
            vec.push_back(-1);
            for(int j=i+1;j<n;j++)vec.push_back(n);
            if(perform_experiment(vec)==(i>1)+1+(i<n-1))res.push_back(res.back());
            else res.push_back(res.back()^1);
        }
        return res;
    }
}
vector<int> find_colours(int _N,vector<int> _X,vector<int> _Y){
    n=_N,m=_X.size();
    for(int i=0;i<n;i++)for(int j=0;j<n;j++)mat[i][j]=0;
    for(int i=0;i<m;i++)mat[_X[i]][_Y[i]]=mat[_Y[i]][_X[i]]=1;
    if(n<=50){
        vector<int> res;
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++){
                vector<int> vec;
                for(int k=0;k<n;k++)if(k==i)vec.push_back(-1);else vec.push_back(j);
                if(perform_experiment(vec)==1){res.push_back(j);break;}
            }
        return res;
    }else return Subtask0::solve();
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 3

Accepted

Test #1:

score: 3

Accepted

time: 0ms

memory: 3896kb

input:

output:

result:

ok #experiments: 2

Test #2:

score: 3

Accepted

time: 0ms

memory: 3816kb

input:

output:

result:

ok #experiments: 3

Test #3:

score: 3

Accepted

time: 0ms

memory: 3884kb

input:

output:

result:

ok #experiments: 3

Test #4:

score: 3

Accepted

time: 0ms

memory: 3812kb

input:

output:

result:

ok #experiments: 4

Subtask #2:

score: 7

Accepted

Dependency #1:

100%

Accepted

Test #5:

score: 7

Accepted

time: 8ms

memory: 3868kb

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:

result:

ok #experiments: 1250

Test #6:

score: 7

Accepted

time: 6ms

memory: 3832kb

input:

output:

result:

ok #experiments: 785

Test #7:

score: 7

Accepted

time: 4ms

memory: 3880kb

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:

result:

ok #experiments: 1613

Test #8:

score: 7

Accepted

time: 0ms

memory: 3928kb

input:

output:

result:

ok #experiments: 1353

Test #9:

score: 7

Accepted

time: 10ms

memory: 3836kb

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:

result:

ok #experiments: 1138

Test #10:

score: 7

Accepted

time: 0ms

memory: 3856kb

input:

output:

result:

ok #experiments: 978

Test #11:

score: 7

Accepted

time: 2ms

memory: 3868kb

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:

result:

ok #experiments: 1278

Test #12:

score: 7

Accepted

time: 7ms

memory: 3924kb

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:

result:

ok #experiments: 1275

Test #13:

score: 7

Accepted

time: 0ms

memory: 3940kb

input:

output:

result:

ok #experiments: 196

Test #14:

score: 7

Accepted

time: 2ms

memory: 4176kb

input:

output:

result:

ok #experiments: 150

Test #15:

score: 7

Accepted

time: 3ms

memory: 3864kb

input:

output:

result:

ok #experiments: 312

Test #16:

score: 7

Accepted

time: 0ms

memory: 4168kb

input:

output:

result:

ok #experiments: 650

Test #17:

score: 7

Accepted

time: 4ms

memory: 3964kb

input:

output:

result:

ok #experiments: 750

Test #18:

score: 7

Accepted

time: 8ms

memory: 3884kb

input:

output:

result:

ok #experiments: 920

Test #19:

score: 7

Accepted

time: 9ms

memory: 4148kb

input:

output:

result:

ok #experiments: 1361

Test #20:

score: 7

Accepted

time: 10ms

memory: 4148kb

input:

output:

result:

ok #experiments: 1109

Test #21:

score: 7

Accepted

time: 3ms

memory: 3884kb

input:

output:

result:

ok #experiments: 1506

Test #22:

score: 7

Accepted

time: 0ms

memory: 3832kb

input:

output:

result:

ok #experiments: 1280

Test #23:

score: 7

Accepted

time: 5ms

memory: 3892kb

input:

output:

result:

ok #experiments: 1376

Test #24:

score: 7

Accepted

time: 5ms

memory: 3848kb

input:

output:

result:

ok #experiments: 1275

Test #25:

score: 7

Accepted

time: 8ms

memory: 4132kb

input:

output:

result:

ok #experiments: 966

Test #26:

score: 7

Accepted

time: 8ms

memory: 4128kb

input:

output:

result:

ok #experiments: 1071

Test #27:

score: 7

Accepted

time: 11ms

memory: 3880kb

input:

1978433568
50
49
10
15
15
46
15
29
4
29
14
29
10
35
10
49
15
18
8
10
19
29
0
10
8
32
8
38
35
44
29
41
30
32
27
38
29
31
15
28
9
14
7
32
21
29
1
19
19
23
18
33
6
27
4
40
27
34
31
47
4
17
11
21
3
41
22
32
39
41
20
46
14
26
27
37
16
17
27
42
4
36
12
17
7
25
8
43
9
13
44
48
2
15
2
45
5
38
17
24
19784335...

output:

result:

ok #experiments: 1208

Test #28:

score: 7

Accepted

time: 4ms

memory: 3876kb

input:

output:

result:

ok #experiments: 1179

Test #29:

score: 7

Accepted

time: 14ms

memory: 3900kb

input:

output:

result:

ok #experiments: 1209

Test #30:

score: 7

Accepted

time: 8ms

memory: 3824kb

input:

output:

result:

ok #experiments: 1187

Test #31:

score: 7

Accepted

time: 7ms

memory: 3892kb

input:

output:

result:

ok #experiments: 1417

Test #32:

score: 7

Accepted

time: 14ms

memory: 3840kb

input:

output:

result:

ok #experiments: 1470

Test #33:

score: 7

Accepted

time: 18ms

memory: 4172kb

input:

output:

result:

ok #experiments: 1275

Subtask #3:

score: 0

Runtime Error

Test #34:

score: 0

Runtime Error

input:

output:

result:

Subtask #4:

score: 10.5

Acceptable Answer

Test #43:

score: 10.5

Acceptable Answer

time: 127ms

memory: 4596kb

input:

output:

result:

points 0.50 points  0.5

Test #44:

score: 10.5

Acceptable Answer

time: 156ms

memory: 4852kb

input:

output:

result:

points 0.50 points  0.5

Test #45:

score: 10.5

Acceptable Answer

time: 149ms

memory: 4636kb

input:

output:

result:

points 0.50 points  0.5

Test #46:

score: 10.5

Acceptable Answer

time: 158ms

memory: 4860kb

input:

output:

result:

points 0.50 points  0.5

Test #47:

score: 10.5

Acceptable Answer

time: 123ms

memory: 4532kb

input:

output:

result:

points 0.50 points  0.5

Test #48:

score: 10.5

Acceptable Answer

time: 102ms

memory: 4600kb

input:

output:

result:

points 0.50 points  0.5

Test #49:

score: 10.5

Acceptable Answer

time: 78ms

memory: 4860kb

input:

output:

result:

points 0.50 points  0.5

Test #50:

score: 10.5

Acceptable Answer

time: 143ms

memory: 4564kb

input:

output:

result:

points 0.50 points  0.5

Test #51:

score: 10.5

Acceptable Answer

time: 27ms

memory: 4528kb

input:

output:

result:

points 0.50 points  0.5

Subtask #5:

score: 0

Skipped

Dependency #1:

100%

Accepted

Dependency #2:

100%

Accepted