oj.uz

답안 #1085729

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1085729 2024-09-08T15:47:23 Z alexander707070 게임 (APIO22_game) C++17
30 / 100
 1849 ms 37968 KB 
#include<bits/stdc++.h>

#define MAXN 300007
using namespace std;

const int bucket_sz=500;

int n,k,bucket[MAXN];
int from[MAXN],to[MAXN];
int mins[MAXN],maxs[MAXN];

int li[MAXN],tim,cnt[MAXN];

vector<int> v[MAXN],r[MAXN],news;

void init(int N,int K){
    n=N; k=K;

    for(int i=1;i<=k;i++){
        bucket[i]=i/bucket_sz+1;
    }

    for(int i=1;i<=k;i++){
        mins[i]=maxs[i]=bucket[i];
        from[i]=to[i]=i;
    }

    for(int i=k+1;i<=n;i++){
        from[i]=n+1; to[i]=0;
        mins[i]=800; maxs[i]=0;
    }
}

int dfs(int x,int val,int val2){
    li[x]=tim;

    if(maxs[x]>val)return 0;
    if(maxs[x]==val and to[x]>=val2)return 0;

    if(mins[x]==maxs[x]){
        to[x]=val2;
        if(from[x]<=to[x] or mins[x]<val){
            if(from[x]<to[x] or x>k)return 1;
        }
    }else{
        maxs[x]=val;
        if(mins[x]<maxs[x])return 1;

        if(mins[x]==maxs[x])news.push_back(x);
    }

    cnt[x]++;
    if(cnt[x]>1500)cout<<1/0;

    for(int i=0;i<v[x].size();i++){
        if(li[v[x][i]]==tim)continue;

        if(dfs(v[x][i],val,val2)==1)return 1;
    }

    return 0;
}

int dfs2(int x,int val,int val2){
    li[x]=tim;

    if(mins[x]<val)return 0;
    if(mins[x]==val and from[x]<=val2)return 0;

    if(mins[x]==maxs[x]){
        from[x]=val2;
        if(from[x]<=to[x] or val<maxs[x]){
            if(from[x]<to[x] or x>k)return 1;
        }
    }else{
        mins[x]=val;
        if(mins[x]<maxs[x])return 1;

        if(mins[x]==maxs[x])news.push_back(x);
    }

    cnt[x]++;
    if(cnt[x]>1500)cout<<1/0;

    for(int i=0;i<r[x].size();i++){
        if(li[r[x][i]]==tim)continue;

        if(dfs2(r[x][i],val,val2)==1)return 1;
    }

    return 0;
}

void dfs3(int x){
    li[x]=tim;

    if(from[x]!=n+1)return;

    for(int i=0;i<v[x].size();i++){
        if(li[v[x][i]]==tim)continue;

        dfs3(v[x][i]);
        from[x]=min(from[x],from[v[x][i]]);
    }
}

int dfs4(int x){
    li[x]=tim;

    if(to[x]!=0)return 0;

    int z=0;
    for(int i=0;i<r[x].size();i++){
        if(li[r[x][i]]==tim)continue;

        z=dfs4(r[x][i]);
        to[x]=max(to[x],to[r[x][i]]);
        if(z==1)return 1;
    }

    if(from[x]<=to[x])return 1;
    return 0;
}

int add_teleporter(int a, int b){
    a++; b++;

    if(a==b){
        if(a<=k)return 1;
        return 0;
    }

    news.clear();

    v[a].push_back(b); tim++;
    int z=dfs(b,maxs[a],to[a]);

    if(z==1)return 1;

    r[b].push_back(a); tim++;
    z=dfs2(a,mins[b],from[b]);

    if(z==1)return 1;

    tim++;
    for(int i:news){
        if(li[i]!=tim)dfs3(i);   
    }

    tim++;
    for(int i:news){
        if(li[i]!=tim){
            if(dfs4(i)==1)return 1;
        }   
    }

    return 0;
}

/*int main(){

    init(6, 3);

    cout<<add_teleporter(3, 4);
    cout<<add_teleporter(5, 0);
    cout<<add_teleporter(4, 5);
    cout<<add_teleporter(5, 3);
    cout<<add_teleporter(1, 4);

    return 0;
}*/

Compilation message

game.cpp: In function 'int dfs(int, int, int)':
game.cpp:53:27: warning: division by zero [-Wdiv-by-zero]
   53 |     if(cnt[x]>1500)cout<<1/0;
      |                          ~^~
game.cpp:55:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
game.cpp: In function 'int dfs2(int, int, int)':
game.cpp:83:27: warning: division by zero [-Wdiv-by-zero]
   83 |     if(cnt[x]>1500)cout<<1/0;
      |                          ~^~
game.cpp:85:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     for(int i=0;i<r[x].size();i++){
      |                 ~^~~~~~~~~~~~
game.cpp: In function 'void dfs3(int)':
game.cpp:99:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
game.cpp: In function 'int dfs4(int)':
game.cpp:113:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for(int i=0;i<r[x].size();i++){
      |                 ~^~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14424 KB Output is correct
2 Correct 6 ms 14424 KB Output is correct
3 Correct 6 ms 14424 KB Output is correct
4 Correct 6 ms 14344 KB Output is correct
5 Correct 6 ms 14424 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14424 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14424 KB Output is correct
2 Correct 6 ms 14424 KB Output is correct
3 Correct 6 ms 14424 KB Output is correct
4 Correct 6 ms 14344 KB Output is correct
5 Correct 6 ms 14424 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14424 KB Output is correct
8 Correct 6 ms 14424 KB Output is correct
9 Correct 7 ms 14388 KB Output is correct
10 Correct 6 ms 14424 KB Output is correct
11 Correct 6 ms 14424 KB Output is correct
12 Correct 8 ms 14424 KB Output is correct
13 Correct 10 ms 14424 KB Output is correct
14 Correct 6 ms 14420 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 7 ms 14424 KB Output is correct
17 Correct 9 ms 14468 KB Output is correct
18 Correct 6 ms 14424 KB Output is correct
19 Correct 10 ms 14424 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14424 KB Output is correct
2 Correct 6 ms 14424 KB Output is correct
3 Correct 6 ms 14424 KB Output is correct
4 Correct 6 ms 14344 KB Output is correct
5 Correct 6 ms 14424 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14424 KB Output is correct
8 Correct 6 ms 14424 KB Output is correct
9 Correct 7 ms 14388 KB Output is correct
10 Correct 6 ms 14424 KB Output is correct
11 Correct 6 ms 14424 KB Output is correct
12 Correct 8 ms 14424 KB Output is correct
13 Correct 10 ms 14424 KB Output is correct
14 Correct 6 ms 14420 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 7 ms 14424 KB Output is correct
17 Correct 9 ms 14468 KB Output is correct
18 Correct 6 ms 14424 KB Output is correct
19 Correct 10 ms 14424 KB Output is correct
20 Correct 7 ms 14424 KB Output is correct
21 Correct 7 ms 14424 KB Output is correct
22 Correct 7 ms 14648 KB Output is correct
23 Correct 7 ms 14404 KB Output is correct
24 Correct 10 ms 14572 KB Output is correct
25 Correct 12 ms 14676 KB Output is correct
26 Correct 9 ms 14572 KB Output is correct
27 Correct 8 ms 14424 KB Output is correct
28 Correct 7 ms 14424 KB Output is correct
29 Correct 8 ms 14424 KB Output is correct

Subtask #4
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14424 KB Output is correct
2 Correct 6 ms 14424 KB Output is correct
3 Correct 6 ms 14424 KB Output is correct
4 Correct 6 ms 14344 KB Output is correct
5 Correct 6 ms 14424 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14424 KB Output is correct
8 Correct 6 ms 14424 KB Output is correct
9 Correct 7 ms 14388 KB Output is correct
10 Correct 6 ms 14424 KB Output is correct
11 Correct 6 ms 14424 KB Output is correct
12 Correct 8 ms 14424 KB Output is correct
13 Correct 10 ms 14424 KB Output is correct
14 Correct 6 ms 14420 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 7 ms 14424 KB Output is correct
17 Correct 9 ms 14468 KB Output is correct
18 Correct 6 ms 14424 KB Output is correct
19 Correct 10 ms 14424 KB Output is correct
20 Correct 7 ms 14424 KB Output is correct
21 Correct 7 ms 14424 KB Output is correct
22 Correct 7 ms 14648 KB Output is correct
23 Correct 7 ms 14404 KB Output is correct
24 Correct 10 ms 14572 KB Output is correct
25 Correct 12 ms 14676 KB Output is correct
26 Correct 9 ms 14572 KB Output is correct
27 Correct 8 ms 14424 KB Output is correct
28 Correct 7 ms 14424 KB Output is correct
29 Correct 8 ms 14424 KB Output is correct
30 Correct 18 ms 16420 KB Output is correct
31 Correct 10 ms 15448 KB Output is correct
32 Correct 26 ms 18324 KB Output is correct
33 Correct 24 ms 17232 KB Output is correct
34 Correct 1413 ms 19028 KB Output is correct
35 Correct 519 ms 18296 KB Output is correct
36 Correct 94 ms 16976 KB Output is correct
37 Correct 49 ms 17124 KB Output is correct
38 Correct 26 ms 16728 KB Output is correct
39 Correct 29 ms 16936 KB Output is correct
40 Correct 1116 ms 19100 KB Output is correct
41 Correct 221 ms 17892 KB Output is correct
42 Correct 140 ms 17556 KB Output is correct
43 Correct 48 ms 18768 KB Output is correct
44 Runtime error 1849 ms 37968 KB Execution killed with signal 4
45 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14424 KB Output is correct
2 Correct 6 ms 14424 KB Output is correct
3 Correct 6 ms 14424 KB Output is correct
4 Correct 6 ms 14344 KB Output is correct
5 Correct 6 ms 14424 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14424 KB Output is correct
8 Correct 6 ms 14424 KB Output is correct
9 Correct 7 ms 14388 KB Output is correct
10 Correct 6 ms 14424 KB Output is correct
11 Correct 6 ms 14424 KB Output is correct
12 Correct 8 ms 14424 KB Output is correct
13 Correct 10 ms 14424 KB Output is correct
14 Correct 6 ms 14420 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 7 ms 14424 KB Output is correct
17 Correct 9 ms 14468 KB Output is correct
18 Correct 6 ms 14424 KB Output is correct
19 Correct 10 ms 14424 KB Output is correct
20 Correct 7 ms 14424 KB Output is correct
21 Correct 7 ms 14424 KB Output is correct
22 Correct 7 ms 14648 KB Output is correct
23 Correct 7 ms 14404 KB Output is correct
24 Correct 10 ms 14572 KB Output is correct
25 Correct 12 ms 14676 KB Output is correct
26 Correct 9 ms 14572 KB Output is correct
27 Correct 8 ms 14424 KB Output is correct
28 Correct 7 ms 14424 KB Output is correct
29 Correct 8 ms 14424 KB Output is correct
30 Correct 18 ms 16420 KB Output is correct
31 Correct 10 ms 15448 KB Output is correct
32 Correct 26 ms 18324 KB Output is correct
33 Correct 24 ms 17232 KB Output is correct
34 Correct 1413 ms 19028 KB Output is correct
35 Correct 519 ms 18296 KB Output is correct
36 Correct 94 ms 16976 KB Output is correct
37 Correct 49 ms 17124 KB Output is correct
38 Correct 26 ms 16728 KB Output is correct
39 Correct 29 ms 16936 KB Output is correct
40 Correct 1116 ms 19100 KB Output is correct
41 Correct 221 ms 17892 KB Output is correct
42 Correct 140 ms 17556 KB Output is correct
43 Correct 48 ms 18768 KB Output is correct
44 Runtime error 1849 ms 37968 KB Execution killed with signal 4
45 Halted 0 ms 0 KB -