oj.uz

답안 #545516

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
545516 2022-04-04T17:18:00 Z MohamedAliSaidane 동굴 (IOI13_cave) C++14
100 / 100
 294 ms 460 KB 
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

#define pb push_back
#define popb pop_back
#define pf push_front
#define popf pop_front
#define all(x) (x).begin(),(x).end()
#define ff first
#define ss second

int nx[4] = {0,0,1,-1}, ny[4] = {1,-1,0,0};
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;}
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);}

/*int N;
vi S, D, C;
void answer(vi A, vi B)
{
    for(int i = 0; i < N; i ++)
        cout << A[i] << ' ';
    cout << '\n';
    for(int i = 0; i < N; i ++)
        cout << B[i] << ' ';
}
int tryCombination(vi A)
{
    for(int door = 0; door < N;door ++)
    {
        if(A[C[door]] != S[C[door]])
            return door;
    }

    return -1;
}*/
void exploreCave(int n)
{
    int ans[n], st[n];
    int cur[n]; memset(cur,0,sizeof(cur));
    bool vis[n]; memset(vis,false,sizeof(vis));
    for(int door = 0; door < n; door ++)
    {
        int repp = tryCombination(cur);
        if(repp == -1 || repp > door)
        {
            int debut = 0;
            int fin = n - 1;
            while(debut < fin)
            {
                int mid = (debut+fin)/2;
                for(int i = debut; i <= mid; i ++)
                {
                    if(vis[i])
                        continue;
                    cur[i] = 1;
                }
                int rep = tryCombination(cur);
                for(int i = debut; i <= mid; i ++)
                {
                    if(vis[i])
                        continue;
                    cur[i] = 0;
                }
                if(rep == door)
                {
                    fin = mid;
                }
                else
                    debut = mid + 1;

            }
            ans[debut] = door;
            st[fin] = cur[fin] = 0;
            vis[fin] = 1;

        }
        else
        {
            int debut = 0;
            int fin = n - 1;
            while(debut < fin)
            {
                int mid = (debut+fin)/2;
                for(int i = debut; i <= mid; i ++)
                {
                    if(vis[i])
                        continue;
                    cur[i] = 1;
                }
                int rep = tryCombination(cur);
                for(int i = debut; i <= mid; i ++)
                {
                    if(vis[i])
                        continue;
                    cur[i] = 0;
                }
                if(rep > door || rep == -1)
                {
                    fin = mid;
                }
                else
                    debut = mid + 1;

            }
            ans[debut] = door;
            st[fin] = cur[fin] = 1;
            vis[fin] = 1;

        }
    }
    answer(st,ans);
}/*
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    cin >> N;
    S.assign(N,0); D.assign(N,0);
    C.assign(N,0);
    for(int i = 0; i < N; i ++)
        cin >> S[i];
    for(int i = 0; i < N; i ++)
        cin >> D[i];
    for(int i = 0; i < N; i ++)
        C[D[i]] = i;
    exploreCave(N);

}
*/

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 420 KB Output is correct
2 Correct 116 ms 408 KB Output is correct
3 Correct 153 ms 432 KB Output is correct
4 Correct 100 ms 460 KB Output is correct
5 Correct 202 ms 428 KB Output is correct
6 Correct 153 ms 428 KB Output is correct
7 Correct 177 ms 460 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 150 ms 444 KB Output is correct
13 Correct 138 ms 428 KB Output is correct
14 Correct 160 ms 428 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 195 ms 428 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 158 ms 432 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 195 ms 440 KB Output is correct
7 Correct 138 ms 340 KB Output is correct
8 Correct 241 ms 428 KB Output is correct
9 Correct 254 ms 460 KB Output is correct
10 Correct 224 ms 340 KB Output is correct
11 Correct 153 ms 432 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 24 ms 364 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 33 ms 360 KB Output is correct
24 Correct 38 ms 352 KB Output is correct
25 Correct 33 ms 348 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 23 ms 368 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 28 ms 372 KB Output is correct
31 Correct 23 ms 340 KB Output is correct
32 Correct 1 ms 308 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 33 ms 352 KB Output is correct
36 Correct 30 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 420 KB Output is correct
2 Correct 116 ms 408 KB Output is correct
3 Correct 153 ms 432 KB Output is correct
4 Correct 100 ms 460 KB Output is correct
5 Correct 202 ms 428 KB Output is correct
6 Correct 153 ms 428 KB Output is correct
7 Correct 177 ms 460 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 150 ms 444 KB Output is correct
13 Correct 138 ms 428 KB Output is correct
14 Correct 160 ms 428 KB Output is correct
15 Correct 195 ms 428 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 158 ms 432 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 195 ms 440 KB Output is correct
21 Correct 138 ms 340 KB Output is correct
22 Correct 241 ms 428 KB Output is correct
23 Correct 254 ms 460 KB Output is correct
24 Correct 224 ms 340 KB Output is correct
25 Correct 153 ms 432 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 300 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 304 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 24 ms 364 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 300 KB Output is correct
48 Correct 33 ms 360 KB Output is correct
49 Correct 38 ms 352 KB Output is correct
50 Correct 33 ms 348 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 23 ms 368 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 28 ms 372 KB Output is correct
56 Correct 23 ms 340 KB Output is correct
57 Correct 1 ms 308 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 33 ms 352 KB Output is correct
61 Correct 30 ms 340 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 88 ms 424 KB Output is correct
64 Correct 108 ms 412 KB Output is correct
65 Correct 158 ms 428 KB Output is correct
66 Correct 113 ms 340 KB Output is correct
67 Correct 183 ms 340 KB Output is correct
68 Correct 146 ms 340 KB Output is correct
69 Correct 195 ms 460 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 138 ms 436 KB Output is correct
73 Correct 156 ms 428 KB Output is correct
74 Correct 154 ms 440 KB Output is correct
75 Correct 163 ms 428 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 188 ms 340 KB Output is correct
79 Correct 150 ms 440 KB Output is correct
80 Correct 239 ms 444 KB Output is correct
81 Correct 294 ms 436 KB Output is correct
82 Correct 240 ms 440 KB Output is correct
83 Correct 153 ms 428 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 24 ms 364 KB Output is correct
86 Correct 167 ms 444 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 300 KB Output is correct
89 Correct 33 ms 360 KB Output is correct
90 Correct 34 ms 372 KB Output is correct
91 Correct 35 ms 344 KB Output is correct
92 Correct 245 ms 432 KB Output is correct
93 Correct 243 ms 440 KB Output is correct
94 Correct 250 ms 432 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 304 KB Output is correct
97 Correct 162 ms 432 KB Output is correct
98 Correct 21 ms 340 KB Output is correct
99 Correct 154 ms 444 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 24 ms 356 KB Output is correct
102 Correct 29 ms 364 KB Output is correct
103 Correct 139 ms 340 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 308 KB Output is correct
107 Correct 32 ms 340 KB Output is correct
108 Correct 34 ms 348 KB Output is correct
109 Correct 248 ms 432 KB Output is correct
110 Correct 231 ms 432 KB Output is correct
111 Correct 1 ms 212 KB Output is correct