oj.uz

Submission #598418

# Submission time Handle Problem Language Result Execution time Memory
598418 2022-07-18T10:28:37 Z Koosha_mv Cave (IOI13_cave) C++14
100 / 100
 526 ms 812 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,int(v.size())) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=5050;

int n,p[N],mark[N],state[N];

void exploreCave(int _n) {
    n=_n;
    vector<int> vec(n);
    iota(all(vec),0);
    while(vec.size()){
        f(i,0,n) mark[i]=state[i];
        int now=tryCombination(mark);
        int l=0,r=vec.size();
        while(l+1<r){
            int mid=(l+r)>>1;
            f(i,0,vec.size()) mark[vec[i]]=(i<mid);
            if(tryCombination(mark)==now){
                l=mid;
            }
            else{
                r=mid;
            }
        }       
        f(i,0,vec.size()) mark[vec[i]]=(i<r);
        int prt=tryCombination(mark);
        int id=vec[l];
        if(now!=-1 && (prt==-1 || prt>now)){
            p[id]=now;
            state[id]=1;
        }
        else{
            p[id]=prt;
            state[id]=0;
        }
        vec.erase(vec.begin()+l);
    }
    answer(state,p);
}
//tryCombination

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:9:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   38 |             f(i,0,vec.size()) mark[vec[i]]=(i<mid);
      |               ~~~~~~~~~~~~~~   
cave.cpp:38:13: note: in expansion of macro 'f'
   38 |             f(i,0,vec.size()) mark[vec[i]]=(i<mid);
      |             ^
cave.cpp:9:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   46 |         f(i,0,vec.size()) mark[vec[i]]=(i<r);
      |           ~~~~~~~~~~~~~~       
cave.cpp:46:9: note: in expansion of macro 'f'
   46 |         f(i,0,vec.size()) mark[vec[i]]=(i<r);
      |         ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 404 KB Output is correct
2 Correct 304 ms 428 KB Output is correct
3 Correct 482 ms 564 KB Output is correct
4 Correct 300 ms 416 KB Output is correct
5 Correct 507 ms 552 KB Output is correct
6 Correct 484 ms 448 KB Output is correct
7 Correct 489 ms 456 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 491 ms 568 KB Output is correct
13 Correct 467 ms 340 KB Output is correct
14 Correct 480 ms 700 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 498 ms 400 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 437 ms 440 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 489 ms 452 KB Output is correct
7 Correct 482 ms 444 KB Output is correct
8 Correct 376 ms 448 KB Output is correct
9 Correct 403 ms 452 KB Output is correct
10 Correct 446 ms 448 KB Output is correct
11 Correct 499 ms 436 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 308 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 76 ms 372 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 74 ms 376 KB Output is correct
24 Correct 74 ms 372 KB Output is correct
25 Correct 75 ms 372 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 77 ms 460 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 74 ms 380 KB Output is correct
31 Correct 57 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 74 ms 372 KB Output is correct
36 Correct 72 ms 384 KB Output is correct
37 Correct 0 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 404 KB Output is correct
2 Correct 304 ms 428 KB Output is correct
3 Correct 482 ms 564 KB Output is correct
4 Correct 300 ms 416 KB Output is correct
5 Correct 507 ms 552 KB Output is correct
6 Correct 484 ms 448 KB Output is correct
7 Correct 489 ms 456 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 491 ms 568 KB Output is correct
13 Correct 467 ms 340 KB Output is correct
14 Correct 480 ms 700 KB Output is correct
15 Correct 498 ms 400 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 437 ms 440 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 489 ms 452 KB Output is correct
21 Correct 482 ms 444 KB Output is correct
22 Correct 376 ms 448 KB Output is correct
23 Correct 403 ms 452 KB Output is correct
24 Correct 446 ms 448 KB Output is correct
25 Correct 499 ms 436 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 308 KB Output is correct
29 Correct 1 ms 308 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 308 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 308 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 308 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 76 ms 372 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 74 ms 376 KB Output is correct
49 Correct 74 ms 372 KB Output is correct
50 Correct 75 ms 372 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 77 ms 460 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 74 ms 380 KB Output is correct
56 Correct 57 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 74 ms 372 KB Output is correct
61 Correct 72 ms 384 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 321 ms 436 KB Output is correct
64 Correct 321 ms 416 KB Output is correct
65 Correct 472 ms 448 KB Output is correct
66 Correct 333 ms 428 KB Output is correct
67 Correct 498 ms 424 KB Output is correct
68 Correct 493 ms 444 KB Output is correct
69 Correct 501 ms 456 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 470 ms 456 KB Output is correct
73 Correct 481 ms 452 KB Output is correct
74 Correct 493 ms 424 KB Output is correct
75 Correct 457 ms 444 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 502 ms 488 KB Output is correct
79 Correct 504 ms 432 KB Output is correct
80 Correct 428 ms 812 KB Output is correct
81 Correct 438 ms 424 KB Output is correct
82 Correct 439 ms 568 KB Output is correct
83 Correct 495 ms 448 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 67 ms 368 KB Output is correct
86 Correct 507 ms 456 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 75 ms 368 KB Output is correct
90 Correct 75 ms 372 KB Output is correct
91 Correct 72 ms 368 KB Output is correct
92 Correct 511 ms 440 KB Output is correct
93 Correct 482 ms 448 KB Output is correct
94 Correct 487 ms 468 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 498 ms 432 KB Output is correct
98 Correct 74 ms 372 KB Output is correct
99 Correct 504 ms 456 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 74 ms 368 KB Output is correct
102 Correct 74 ms 376 KB Output is correct
103 Correct 515 ms 468 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 74 ms 392 KB Output is correct
108 Correct 70 ms 388 KB Output is correct
109 Correct 526 ms 468 KB Output is correct
110 Correct 510 ms 452 KB Output is correct
111 Correct 0 ms 308 KB Output is correct