oj.uz

Submission #261730

# Submission time Handle Problem Language Result Execution time Memory
261730 2020-08-12T03:19:10 Z yabsed Cave (IOI13_cave) C++17
100 / 100
 1207 ms 760 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    //printf("sdffsd %d \n", N);;
    int which_switch[N], how_switch[N], used[N], used_ans[N], used_for[N];
    memset(which_switch, 0, sizeof(which_switch));
    memset(how_switch, 0, sizeof(how_switch));
    memset(used, 0, sizeof(used));
    memset(used_ans, 0, sizeof(used_ans));
    memset(used_for, 0, sizeof(used_for));
    //printf("sdffsd %d \n", N);;
    for(int i=0;i<N;i++){
         //printf("sdffsd %d\n", i);;
        vector <int> p, np;

        int v[N];
        memset(v, 0, sizeof(v));
        for(int j=0;j<N;j++){
            //printf("%d", used[j]);
            if(!used[j])p.push_back(j);
            else np.push_back(j);
        }
        //printf("\n");
        int l=0, r=p.size()-1, mid;


        for(int j=0;j<np.size();j++)v[np[j]]=used_ans[np[j]];
        for(int j=0;j<p.size();j++)v[p[j]]=0;
        int res=tryCombination(v);
        if(res==i)how_switch[i]=1;
        else how_switch[i]=0;

        //printf("%d %d\n", i, how_switch[i]);
        while(l<r){
            mid=(l+r)/2;
            for(int j=0;j<np.size();j++)v[np[j]]=used_ans[np[j]];
            for(int j=0;j<=mid;j++)v[p[j]]=how_switch[i];
            for(int j=mid+1;j<p.size();j++)v[p[j]]=1-how_switch[i];
            int res=tryCombination(v);
            if(res==i)l=mid+1;
            else r=mid;
        }
        //printf("%d %d\n", l, r);
        which_switch[i]=p[l];
        used[p[l]]=1;
        used_ans[p[l]]=how_switch[i];
        used_for[p[l]]=i;

    }
    answer(used_ans, used_for);
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:28:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0;j<np.size();j++)v[np[j]]=used_ans[np[j]];
                     ~^~~~~~~~~~
cave.cpp:29:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0;j<p.size();j++)v[p[j]]=0;
                     ~^~~~~~~~~
cave.cpp:37:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0;j<np.size();j++)v[np[j]]=used_ans[np[j]];
                         ~^~~~~~~~~~
cave.cpp:39:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=mid+1;j<p.size();j++)v[p[j]]=1-how_switch[i];
                             ~^~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 747 ms 636 KB Output is correct
2 Correct 765 ms 588 KB Output is correct
3 Correct 1165 ms 632 KB Output is correct
4 Correct 788 ms 632 KB Output is correct
5 Correct 1166 ms 640 KB Output is correct
6 Correct 1161 ms 624 KB Output is correct
7 Correct 1168 ms 756 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1127 ms 628 KB Output is correct
13 Correct 1142 ms 628 KB Output is correct
14 Correct 1131 ms 760 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1207 ms 636 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1124 ms 632 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1110 ms 628 KB Output is correct
7 Correct 1144 ms 632 KB Output is correct
8 Correct 1196 ms 632 KB Output is correct
9 Correct 1192 ms 760 KB Output is correct
10 Correct 1204 ms 632 KB Output is correct
11 Correct 1074 ms 632 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 372 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 384 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 372 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 163 ms 508 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 178 ms 468 KB Output is correct
24 Correct 170 ms 384 KB Output is correct
25 Correct 170 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 163 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 163 ms 504 KB Output is correct
31 Correct 147 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 158 ms 504 KB Output is correct
36 Correct 167 ms 384 KB Output is correct
37 Correct 1 ms 256 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 747 ms 636 KB Output is correct
2 Correct 765 ms 588 KB Output is correct
3 Correct 1165 ms 632 KB Output is correct
4 Correct 788 ms 632 KB Output is correct
5 Correct 1166 ms 640 KB Output is correct
6 Correct 1161 ms 624 KB Output is correct
7 Correct 1168 ms 756 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1127 ms 628 KB Output is correct
13 Correct 1142 ms 628 KB Output is correct
14 Correct 1131 ms 760 KB Output is correct
15 Correct 1207 ms 636 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1124 ms 632 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1110 ms 628 KB Output is correct
21 Correct 1144 ms 632 KB Output is correct
22 Correct 1196 ms 632 KB Output is correct
23 Correct 1192 ms 760 KB Output is correct
24 Correct 1204 ms 632 KB Output is correct
25 Correct 1074 ms 632 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 368 KB Output is correct
30 Correct 1 ms 372 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 0 ms 256 KB Output is correct
41 Correct 0 ms 256 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 1 ms 360 KB Output is correct
45 Correct 163 ms 508 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 178 ms 468 KB Output is correct
49 Correct 170 ms 384 KB Output is correct
50 Correct 170 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 163 ms 384 KB Output is correct
54 Correct 1 ms 384 KB Output is correct
55 Correct 163 ms 504 KB Output is correct
56 Correct 147 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 158 ms 504 KB Output is correct
61 Correct 167 ms 384 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 747 ms 632 KB Output is correct
64 Correct 773 ms 632 KB Output is correct
65 Correct 1163 ms 632 KB Output is correct
66 Correct 789 ms 632 KB Output is correct
67 Correct 1173 ms 632 KB Output is correct
68 Correct 1145 ms 636 KB Output is correct
69 Correct 1154 ms 632 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 1147 ms 632 KB Output is correct
73 Correct 1143 ms 632 KB Output is correct
74 Correct 1138 ms 512 KB Output is correct
75 Correct 1134 ms 512 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 1 ms 512 KB Output is correct
78 Correct 1141 ms 640 KB Output is correct
79 Correct 1163 ms 640 KB Output is correct
80 Correct 1192 ms 632 KB Output is correct
81 Correct 1179 ms 512 KB Output is correct
82 Correct 1201 ms 624 KB Output is correct
83 Correct 1075 ms 632 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 155 ms 508 KB Output is correct
86 Correct 1069 ms 616 KB Output is correct
87 Correct 1 ms 256 KB Output is correct
88 Correct 1 ms 384 KB Output is correct
89 Correct 167 ms 464 KB Output is correct
90 Correct 157 ms 384 KB Output is correct
91 Correct 167 ms 384 KB Output is correct
92 Correct 1154 ms 512 KB Output is correct
93 Correct 1167 ms 628 KB Output is correct
94 Correct 1181 ms 632 KB Output is correct
95 Correct 1 ms 384 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 1093 ms 620 KB Output is correct
98 Correct 165 ms 376 KB Output is correct
99 Correct 1114 ms 632 KB Output is correct
100 Correct 1 ms 384 KB Output is correct
101 Correct 156 ms 384 KB Output is correct
102 Correct 157 ms 472 KB Output is correct
103 Correct 1059 ms 680 KB Output is correct
104 Correct 1 ms 384 KB Output is correct
105 Correct 1 ms 256 KB Output is correct
106 Correct 1 ms 384 KB Output is correct
107 Correct 172 ms 384 KB Output is correct
108 Correct 166 ms 596 KB Output is correct
109 Correct 1187 ms 632 KB Output is correct
110 Correct 1192 ms 512 KB Output is correct
111 Correct 1 ms 384 KB Output is correct