oj.uz

Submission #412372

# Submission time Handle Problem Language Result Execution time Memory
412372 2021-05-26T18:10:30 Z losmi247 Cave (IOI13_cave) C++14
100 / 100
 527 ms 580 KB 
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
typedef long long ll;
const int N = 5002;

int n;


/*int puta = 0;
int *prvi,*drugi;
int *kojisvic;
int tryCombination(int *S){
    puta++;
    for(int i = 0; i < n; i++){
        if(S[kojisvic[i]] != prvi[kojisvic[i]]) return i;
    }
    return -1;
}

void answer(int *S,int *D){
    for(int i = 0; i < n; i++){
        if(S[i] != prvi[i]){
            cout << "WA1" << endl;
            exit(0);
        }
    }
    for(int i = 0; i < n; i++){
        if(D[i] != drugi[i]){
            cout << "WA2" << endl;

            for(int i = 0; i < n; i++){
                cout << D[i] << " ";
            }
            cout << endl;

            exit(0);
        }
    }
    cout << "OK" << endl;
}*/




void znamred(){
    int *niz = (int*)malloc(sizeof(int)*n);
    int *odg1 = (int*)malloc(sizeof(int)*n);
    for(int i = 0; i < n; i++){ niz[i] = 0; odg1[i] = i; }

    while(1){
        int x = tryCombination(niz);
        if(x == -1) break;
        niz[x] ^= 1;
    }

    answer(niz,odg1);
}

void znamkod(){
    int *niz = (int*)malloc(sizeof(int)*n);
    int *odg1 = (int*)malloc(sizeof(int)*n);
    for(int i = 0; i < n; i++) niz[i] = 0;

    for(int i = 0; i < n; i++){
        niz[i] = 1;
        odg1[i] = tryCombination(niz);
        niz[i] = 0;
    }

    answer(niz,odg1);
}

void zasve(){
    int *niz = (int*)malloc(sizeof(int)*n);
    int *odg1 = (int*)malloc(sizeof(int)*n);
    int *treba = (int*)malloc(sizeof(int)*n);
    for(int i = 0; i < n; i++) niz[i] = 0;
    for(int i = 0; i < n; i++) treba[i] = 0;
    for(int i = 0; i < n; i++) odg1[i] = -1;


    for(int i = 0; i < n; i++){   /// gledas i-ta vrata, trazis kako treba da stoji i ko je kontrolise
        /// kako treba da mu stoji svic?
        for(int j = 0; j < n; j++){
            if(odg1[j] == -1) niz[j] = 0;
        }
        int x = tryCombination(niz);
        int svic = 0;
        if(x > i || x == -1) svic = 0;
        else svic = 1;

        if(svic == 0){
            for(int j = 0; j < n; j++){
                if(odg1[j] == -1) niz[j] = 1;
            }
        }

        /// koji je njegov svic?
        vector <int> moze;
        for(int j = 0; j < n; j++){
            if(odg1[j] == -1) moze.push_back(j);
        }

        int l = 0,r = moze.size()-1;
        while(l < r){
            int mid = l+(r-l)/2;
            for(int h = l; h <= mid; h++){
                niz[moze[h]] ^= 1;
            }
            int y = tryCombination(niz);
            for(int h = l; h <= mid; h++){
                niz[moze[h]] ^= 1;
            }
            if(y > i || y == -1){
                r = mid;
            }
            else{
                l = mid+1;
            }
        }

        odg1[moze[l]] = i;
        treba[moze[l]] = svic;
        niz[moze[l]] ^= 1;
    }

    answer(treba,odg1);
}

void exploreCave(int br){
    n = br;

zasve();
    return;

    int *pr = (int*)malloc(sizeof(int)*n);
    for(int i = 0; i < n; i++) pr[i] = 0;
    if(tryCombination(pr) == -1){
        znamkod();
        return;
    }



    znamred();
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 452 KB Output is correct
2 Correct 191 ms 428 KB Output is correct
3 Correct 294 ms 460 KB Output is correct
4 Correct 202 ms 428 KB Output is correct
5 Correct 336 ms 460 KB Output is correct
6 Correct 308 ms 460 KB Output is correct
7 Correct 340 ms 460 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 304 ms 332 KB Output is correct
13 Correct 303 ms 332 KB Output is correct
14 Correct 304 ms 440 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 341 ms 440 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 335 ms 460 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 341 ms 480 KB Output is correct
7 Correct 323 ms 460 KB Output is correct
8 Correct 507 ms 484 KB Output is correct
9 Correct 508 ms 480 KB Output is correct
10 Correct 512 ms 484 KB Output is correct
11 Correct 320 ms 480 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 46 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 65 ms 332 KB Output is correct
24 Correct 65 ms 304 KB Output is correct
25 Correct 66 ms 356 KB Output is correct
26 Correct 1 ms 284 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 49 ms 356 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 48 ms 360 KB Output is correct
31 Correct 48 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 66 ms 332 KB Output is correct
36 Correct 68 ms 356 KB Output is correct
37 Correct 1 ms 204 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 452 KB Output is correct
2 Correct 191 ms 428 KB Output is correct
3 Correct 294 ms 460 KB Output is correct
4 Correct 202 ms 428 KB Output is correct
5 Correct 336 ms 460 KB Output is correct
6 Correct 308 ms 460 KB Output is correct
7 Correct 340 ms 460 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 304 ms 332 KB Output is correct
13 Correct 303 ms 332 KB Output is correct
14 Correct 304 ms 440 KB Output is correct
15 Correct 341 ms 440 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 335 ms 460 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 341 ms 480 KB Output is correct
21 Correct 323 ms 460 KB Output is correct
22 Correct 507 ms 484 KB Output is correct
23 Correct 508 ms 480 KB Output is correct
24 Correct 512 ms 484 KB Output is correct
25 Correct 320 ms 480 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 46 ms 332 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 65 ms 332 KB Output is correct
49 Correct 65 ms 304 KB Output is correct
50 Correct 66 ms 356 KB Output is correct
51 Correct 1 ms 284 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 49 ms 356 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 48 ms 360 KB Output is correct
56 Correct 48 ms 332 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 66 ms 332 KB Output is correct
61 Correct 68 ms 356 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 212 ms 432 KB Output is correct
64 Correct 192 ms 460 KB Output is correct
65 Correct 311 ms 480 KB Output is correct
66 Correct 202 ms 460 KB Output is correct
67 Correct 340 ms 496 KB Output is correct
68 Correct 304 ms 460 KB Output is correct
69 Correct 335 ms 480 KB Output is correct
70 Correct 1 ms 296 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 304 ms 580 KB Output is correct
73 Correct 302 ms 488 KB Output is correct
74 Correct 305 ms 492 KB Output is correct
75 Correct 334 ms 476 KB Output is correct
76 Correct 1 ms 204 KB Output is correct
77 Correct 1 ms 204 KB Output is correct
78 Correct 335 ms 480 KB Output is correct
79 Correct 323 ms 484 KB Output is correct
80 Correct 527 ms 460 KB Output is correct
81 Correct 505 ms 460 KB Output is correct
82 Correct 510 ms 460 KB Output is correct
83 Correct 315 ms 460 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 45 ms 332 KB Output is correct
86 Correct 280 ms 476 KB Output is correct
87 Correct 1 ms 204 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 65 ms 332 KB Output is correct
90 Correct 69 ms 452 KB Output is correct
91 Correct 66 ms 372 KB Output is correct
92 Correct 453 ms 480 KB Output is correct
93 Correct 460 ms 476 KB Output is correct
94 Correct 456 ms 460 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 302 ms 460 KB Output is correct
98 Correct 47 ms 332 KB Output is correct
99 Correct 299 ms 460 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 45 ms 360 KB Output is correct
102 Correct 48 ms 368 KB Output is correct
103 Correct 293 ms 460 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 224 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 70 ms 360 KB Output is correct
108 Correct 69 ms 364 KB Output is correct
109 Correct 458 ms 480 KB Output is correct
110 Correct 494 ms 480 KB Output is correct
111 Correct 1 ms 204 KB Output is correct