oj.uz

Submission #31082

# Submission time Handle Problem Language Result Execution time Memory
31082 2017-08-06T16:55:41 Z WhipppedCream Cave (IOI13_cave) C++14
100 / 100
 1178 ms 644 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pb push_back
bool solved[5005];
int sol[5005];
int connect[5005];
int arr[5005];
int tmp[5005];
vi cand;
void exploreCave(int n)
{
    for(int i = 0; i< n; i++) cand.pb(i);
    for(int it = 0; it< n-1; it++)
    {
        //printf("-----iteration %d\n", it);
        for(int i = 0; i< n; i++) if(solved[i]) arr[i] = sol[i];
        for(int i = 0; i< (int) cand.size(); i++) arr[cand[i]] = 0;
        int last = tryCombination(arr);
        if(last == -1) last = 1e9;
        int L = 0, R = cand.size()-1;
        memset(tmp, 0, sizeof tmp);
        while(L< R)
        {
            //printf("L = %d and R = %d\n", L, R);
            int mid = (L+R)/2;
            for(int i = 0; i< n; i++) if(solved[i]) arr[i] = sol[i];
            for(int i = mid+1; i<= R; i++) if(!solved[cand[i]]) arr[cand[i]] = 1-arr[cand[i]];
            int x = tryCombination(arr);
            if(x == -1) x = 1e9;
            if(x< last)
            {
                L = mid+1;
                last = x;
                if(L == R) sol[cand[L]] = 1-arr[cand[L]];
            }
            else if(x> last)
            {
                L = mid+1;
                if(L == R) sol[cand[L]] = arr[cand[L]];
                for(int i = mid+1; i<= R; i++) if(!solved[cand[i]]) arr[cand[i]] = 1-arr[cand[i]];
            }
            else
            {
                int trex = R;
                R = mid;
                if(L == R) sol[cand[L]]= 1-arr[cand[L]];
                for(int i = mid+1; i<= trex; i++) if(!solved[cand[i]]) arr[cand[i]] = 1-arr[cand[i]];
            }
        }
        connect[cand[L]] = last;
        solved[cand[L]] = 1;
        //printf("connect %d to %d\n", cand[L], last);
        //printf("position for %d is %d\n", cand[L], sol[cand[L]]);
        cand.erase(cand.begin()+L);
    }
    int pos = cand[0];
    //printf("pos is %d\n", pos);
    memset(arr, 0, sizeof arr);
    for(int i = 0; i< n; i++) if(solved[i]) arr[i] = sol[i];
    int x = tryCombination(arr);
    int y;
    if(x == -1)
    {
        arr[pos] = 1-arr[pos];
        y = tryCombination(arr);
        sol[pos] = 1-arr[pos];
    }
    else
    {
        y = x;
        sol[pos] = 1-arr[pos];
    }
    connect[pos] = y;
    answer(sol, connect);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 564 KB Output is correct
2 Correct 427 ms 640 KB Output is correct
3 Correct 765 ms 576 KB Output is correct
4 Correct 404 ms 640 KB Output is correct
5 Correct 631 ms 640 KB Output is correct
6 Correct 626 ms 592 KB Output is correct
7 Correct 610 ms 640 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 645 ms 592 KB Output is correct
13 Correct 632 ms 556 KB Output is correct
14 Correct 638 ms 512 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 638 ms 580 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 630 ms 604 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 603 ms 640 KB Output is correct
7 Correct 599 ms 580 KB Output is correct
8 Correct 967 ms 640 KB Output is correct
9 Correct 896 ms 588 KB Output is correct
10 Correct 886 ms 640 KB Output is correct
11 Correct 531 ms 640 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 452 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 452 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 5 ms 396 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 83 ms 492 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 144 ms 504 KB Output is correct
24 Correct 154 ms 512 KB Output is correct
25 Correct 182 ms 504 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 94 ms 632 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 81 ms 504 KB Output is correct
31 Correct 79 ms 504 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 155 ms 504 KB Output is correct
36 Correct 163 ms 640 KB Output is correct
37 Correct 5 ms 512 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 564 KB Output is correct
2 Correct 427 ms 640 KB Output is correct
3 Correct 765 ms 576 KB Output is correct
4 Correct 404 ms 640 KB Output is correct
5 Correct 631 ms 640 KB Output is correct
6 Correct 626 ms 592 KB Output is correct
7 Correct 610 ms 640 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 645 ms 592 KB Output is correct
13 Correct 632 ms 556 KB Output is correct
14 Correct 638 ms 512 KB Output is correct
15 Correct 638 ms 580 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 630 ms 604 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 603 ms 640 KB Output is correct
21 Correct 599 ms 580 KB Output is correct
22 Correct 967 ms 640 KB Output is correct
23 Correct 896 ms 588 KB Output is correct
24 Correct 886 ms 640 KB Output is correct
25 Correct 531 ms 640 KB Output is correct
26 Correct 6 ms 452 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 452 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 5 ms 512 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 6 ms 512 KB Output is correct
38 Correct 5 ms 396 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 6 ms 512 KB Output is correct
42 Correct 5 ms 512 KB Output is correct
43 Correct 6 ms 384 KB Output is correct
44 Correct 6 ms 512 KB Output is correct
45 Correct 83 ms 492 KB Output is correct
46 Correct 5 ms 384 KB Output is correct
47 Correct 7 ms 384 KB Output is correct
48 Correct 144 ms 504 KB Output is correct
49 Correct 154 ms 512 KB Output is correct
50 Correct 182 ms 504 KB Output is correct
51 Correct 6 ms 384 KB Output is correct
52 Correct 6 ms 384 KB Output is correct
53 Correct 94 ms 632 KB Output is correct
54 Correct 6 ms 512 KB Output is correct
55 Correct 81 ms 504 KB Output is correct
56 Correct 79 ms 504 KB Output is correct
57 Correct 6 ms 512 KB Output is correct
58 Correct 5 ms 512 KB Output is correct
59 Correct 5 ms 512 KB Output is correct
60 Correct 155 ms 504 KB Output is correct
61 Correct 163 ms 640 KB Output is correct
62 Correct 5 ms 512 KB Output is correct
63 Correct 437 ms 536 KB Output is correct
64 Correct 392 ms 640 KB Output is correct
65 Correct 639 ms 584 KB Output is correct
66 Correct 430 ms 552 KB Output is correct
67 Correct 588 ms 592 KB Output is correct
68 Correct 581 ms 640 KB Output is correct
69 Correct 586 ms 576 KB Output is correct
70 Correct 5 ms 512 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 624 ms 588 KB Output is correct
73 Correct 629 ms 564 KB Output is correct
74 Correct 690 ms 564 KB Output is correct
75 Correct 633 ms 580 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 5 ms 512 KB Output is correct
78 Correct 566 ms 640 KB Output is correct
79 Correct 534 ms 576 KB Output is correct
80 Correct 914 ms 640 KB Output is correct
81 Correct 923 ms 640 KB Output is correct
82 Correct 902 ms 588 KB Output is correct
83 Correct 628 ms 592 KB Output is correct
84 Correct 5 ms 384 KB Output is correct
85 Correct 83 ms 504 KB Output is correct
86 Correct 524 ms 596 KB Output is correct
87 Correct 5 ms 512 KB Output is correct
88 Correct 6 ms 512 KB Output is correct
89 Correct 186 ms 504 KB Output is correct
90 Correct 174 ms 504 KB Output is correct
91 Correct 139 ms 640 KB Output is correct
92 Correct 1110 ms 644 KB Output is correct
93 Correct 1134 ms 592 KB Output is correct
94 Correct 1178 ms 592 KB Output is correct
95 Correct 5 ms 384 KB Output is correct
96 Correct 6 ms 384 KB Output is correct
97 Correct 704 ms 588 KB Output is correct
98 Correct 109 ms 644 KB Output is correct
99 Correct 625 ms 576 KB Output is correct
100 Correct 5 ms 384 KB Output is correct
101 Correct 93 ms 504 KB Output is correct
102 Correct 110 ms 500 KB Output is correct
103 Correct 574 ms 580 KB Output is correct
104 Correct 5 ms 384 KB Output is correct
105 Correct 6 ms 384 KB Output is correct
106 Correct 5 ms 384 KB Output is correct
107 Correct 156 ms 504 KB Output is correct
108 Correct 138 ms 500 KB Output is correct
109 Correct 1130 ms 592 KB Output is correct
110 Correct 1080 ms 592 KB Output is correct
111 Correct 6 ms 384 KB Output is correct