oj.uz

Submission #908442

# Submission time Handle Problem Language Result Execution time Memory
908442 2024-01-16T12:14:20 Z tosivanmak Cave (IOI13_cave) C++17
100 / 100
 172 ms 908 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
 
 
#ifdef __cplusplus
extern "C" {
#endif
int tryCombination(int S[]);
void answer(int S[], int D[]);
void exploreCave(int N);
#ifdef __cplusplus
}
#endif

// int N;
// int realS[5005],realD[5005],inv[5005];
// void answer(int S[], int D[]) {
//     int i;
//     int correct = 1;
//     for (i = 0; i < N; ++i){
//         if (S[i] != realS[i] || D[i] != realD[i]) {
//             correct = 0;
//             break;
//         }
//     }

//     if (correct){
//        cout<<"CORRECT\n";
//     }
//     else{
//        cout<<"INCORRECT\n";
//     }
//     for (i = 0; i < N; ++i) {
//         cout<<S[i]<<" ";
//     }
//    cout<<'\n';

//     for (i = 0; i < N; ++i) {
//         cout<<D[i]<<" ";
//     }
//     cout<<'\n';
// }

// int tryCombination(int S[]) {
//     int i;
//     for (i = 0; i < N; i++){
//         if (S[inv[i]] != realS[inv[i]]){
//             // cout<<S[inv[i]]<<" "<<realS[inv[i]]<<"\n";
//             return i;
//         }
//     }
//     return -1;
// }
vector<ll>cur;
int a[5005];
bool canuse[5005];
bool open[5005];
int refdoor[5005];
// TODO: global variables can be declared here
 
int ck(ll l, ll r){
    for(int i=l;i<=r;i++){
        a[cur[i]]^=1;
    }

    int lol=tryCombination(a);
    for(int i=l;i<=r;i++){
        a[cur[i]]^=1;
        }
    return lol;
}
void get(ll id){
    ll l=0,r=cur.size()-1;
    int compare=ck(1,0);
    while(l<=r){
        if(l==r){
            break;
        }
        else if(l==r-1){
          ll uiuiu=ck(l,l);
            if((compare==id&&uiuiu!=compare) or (uiuiu==id&&uiuiu!=compare)){
                r=l;
            }
            else{
               l=r;
            }
            break;
        }
        else{
            ll mid=(l+r)>>1;
            int uiuiu=ck(l,mid);
            if((compare==id&&uiuiu!=compare) or (uiuiu==id&&uiuiu!=compare)){
                r=mid;
            }
            else{
               l=mid+1;
            }
        }
    }
    if(compare==id){
        open[cur[l]]=0;
        a[cur[l]]=0;
    }
    else{
        open[cur[l]]=1;
        a[cur[l]]=1;
    }
    refdoor[cur[l]]=id;
    canuse[cur[l]]=0;
}
void exploreCave(int N) {
  // TODO: implementation
    int n=N;
    for(int i=0;i<n;i++){
        a[i]=1;
        canuse[i]=1;
        cur.push_back(i);
    }
  for(int i=0;i<n;i++){
      get(i);
      cur.clear();
      for(int j=0;j<n;j++){
          if(canuse[j]){
              cur.push_back(j);
          }
      }
    //   for(auto& u: cur){
    //       cout<<u<<" ";
    //   }
    //   cout<<"\n\n\n\n\n";
  }
    int state[n],ref[n];
    for(int i=0;i<n;i++){
        state[i]=open[i];
        // cout<<state[i]<<" ";
        ref[i]=refdoor[i];
    }
    // for(int i=0;i<n;i++){
    //     cout<<ref[i]<<" ";
    // }
    answer(state,ref);
}

// int main(){
//     ios::sync_with_stdio(0);
//     cin.tie(0); cout.tie(0);
//     cin>>N;
//     for(int i=0;i<N;i++){
//         cin>>realS[i];
//     }
//     for(int i=0;i<N;i++){
//         cin>>realD[i];
//         inv[realD[i]]=i;
//     }
//     exploreCave(N);
// }

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 572 KB Output is correct
2 Correct 96 ms 600 KB Output is correct
3 Correct 162 ms 600 KB Output is correct
4 Correct 102 ms 648 KB Output is correct
5 Correct 158 ms 852 KB Output is correct
6 Correct 141 ms 656 KB Output is correct
7 Correct 149 ms 644 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 145 ms 604 KB Output is correct
13 Correct 142 ms 668 KB Output is correct
14 Correct 141 ms 604 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 620 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 139 ms 656 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 146 ms 908 KB Output is correct
7 Correct 149 ms 852 KB Output is correct
8 Correct 141 ms 664 KB Output is correct
9 Correct 142 ms 676 KB Output is correct
10 Correct 141 ms 604 KB Output is correct
11 Correct 132 ms 668 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 21 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 21 ms 348 KB Output is correct
24 Correct 21 ms 532 KB Output is correct
25 Correct 21 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 22 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 21 ms 344 KB Output is correct
31 Correct 24 ms 648 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 21 ms 348 KB Output is correct
36 Correct 21 ms 544 KB Output is correct
37 Correct 1 ms 348 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 572 KB Output is correct
2 Correct 96 ms 600 KB Output is correct
3 Correct 162 ms 600 KB Output is correct
4 Correct 102 ms 648 KB Output is correct
5 Correct 158 ms 852 KB Output is correct
6 Correct 141 ms 656 KB Output is correct
7 Correct 149 ms 644 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 145 ms 604 KB Output is correct
13 Correct 142 ms 668 KB Output is correct
14 Correct 141 ms 604 KB Output is correct
15 Correct 150 ms 620 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 139 ms 656 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 146 ms 908 KB Output is correct
21 Correct 149 ms 852 KB Output is correct
22 Correct 141 ms 664 KB Output is correct
23 Correct 142 ms 676 KB Output is correct
24 Correct 141 ms 604 KB Output is correct
25 Correct 132 ms 668 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 440 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 21 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 21 ms 348 KB Output is correct
49 Correct 21 ms 532 KB Output is correct
50 Correct 21 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 22 ms 348 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 21 ms 344 KB Output is correct
56 Correct 24 ms 648 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 21 ms 348 KB Output is correct
61 Correct 21 ms 544 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 94 ms 604 KB Output is correct
64 Correct 94 ms 600 KB Output is correct
65 Correct 165 ms 604 KB Output is correct
66 Correct 98 ms 640 KB Output is correct
67 Correct 149 ms 660 KB Output is correct
68 Correct 149 ms 848 KB Output is correct
69 Correct 157 ms 600 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 147 ms 680 KB Output is correct
73 Correct 148 ms 856 KB Output is correct
74 Correct 149 ms 672 KB Output is correct
75 Correct 134 ms 604 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 163 ms 600 KB Output is correct
79 Correct 145 ms 604 KB Output is correct
80 Correct 141 ms 604 KB Output is correct
81 Correct 172 ms 656 KB Output is correct
82 Correct 142 ms 600 KB Output is correct
83 Correct 132 ms 652 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 21 ms 348 KB Output is correct
86 Correct 135 ms 656 KB Output is correct
87 Correct 1 ms 348 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 22 ms 348 KB Output is correct
90 Correct 21 ms 532 KB Output is correct
91 Correct 21 ms 348 KB Output is correct
92 Correct 157 ms 660 KB Output is correct
93 Correct 145 ms 600 KB Output is correct
94 Correct 141 ms 604 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 132 ms 668 KB Output is correct
98 Correct 21 ms 552 KB Output is correct
99 Correct 138 ms 660 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 21 ms 544 KB Output is correct
102 Correct 21 ms 348 KB Output is correct
103 Correct 133 ms 652 KB Output is correct
104 Correct 1 ms 344 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 1 ms 348 KB Output is correct
107 Correct 23 ms 348 KB Output is correct
108 Correct 21 ms 536 KB Output is correct
109 Correct 148 ms 660 KB Output is correct
110 Correct 142 ms 656 KB Output is correct
111 Correct 1 ms 600 KB Output is correct