oj.uz

Submission #983893

# Submission time Handle Problem Language Result Execution time Memory
983893 2024-05-16T07:47:44 Z vjudge1 Game (APIO22_game) C++17
30 / 100
 159 ms 247732 KB 
#include "game.h"
#include <bits/stdc++.h>

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 3e3 + 9 , mod = 1e9 + 7;
bool a[N][1009][2] ;
int b[N][1009][2] , ind = 0;
vector<int>v[5000000];

int n , k;
int ans = 0 , ind1 = 0;
vector<int>v1;

void get(int x , int y , int f){
    a[x][y][f] = 1;
    int m = b[x][y][f];
    for(auto to : v[m])
        if(!a[to][y][f])
            get(to , y , f);
    v[m].clear();
    b[x][y][f] = 0;
    v1.pb(m);
}



void add(int x , int y , int f , int p){
    if(b[x][y][f] == 0){
        if(ind < 5e6)
            b[x][y][f] = ++ind;
        else
            b[x][y][f] = v1[ind1] , ind1++;
    }
    v[b[x][y][f]].pb(p);

}
void init(int n,  int k){
    ::n = n , ::k = k;
    for(int i = 1; i <= k; i++)
        a[i][i][0] = a[i][i][1] = 1;
    for(int i = 1; i < k; i++){
        for(int j = 1; j <= k; j++){
            if(!a[i + 1][j][0])
                add(i , j , 0 , i + 1);
            if(!a[i][j][1])
                add(i + 1 , j , 1 , i);
            if(a[i][j][0])
                get(i ,  j ,0);
            if(a[i + 1][j][1])
                get(i + 1,j , 1);
            }
    }
}

int add_teleporter(int x , int y){
    if(ans == 1)
        return ans;
    x++ , y++;
    for(int i = 1; i <= k; i++){
        if(!a[y][i][0])
            add(x , i , 0 , y);
        if(!a[x][i][1])
            add(y , i , 1 , x );
        if(a[x][i][0] && a[y][i][1])
            ans = 1;
        if(a[x][i][0])
            get(x , i , 0);
        if(a[y][i][1])
            get(y , i ,  1);
    }
    return ans;
}
/*
int main(){
    TL;
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    init(6 , 3);
    cout<<add_teleporter(3 , 4)<<"\n";
    cout<<add_teleporter(5 , 0)<<"\n";
    cout<<add_teleporter(4 , 5)<<"\n";
    cout<<add_teleporter(5 , 3)<<"\n";
    cout<<add_teleporter(1 , 4)<<"\n";
}*/
// Author : حسن

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 121424 KB Output is correct
2 Correct 31 ms 121688 KB Output is correct
3 Correct 29 ms 122456 KB Output is correct
4 Correct 28 ms 121632 KB Output is correct
5 Correct 29 ms 122456 KB Output is correct
6 Correct 32 ms 122456 KB Output is correct
7 Correct 31 ms 122448 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 121424 KB Output is correct
2 Correct 31 ms 121688 KB Output is correct
3 Correct 29 ms 122456 KB Output is correct
4 Correct 28 ms 121632 KB Output is correct
5 Correct 29 ms 122456 KB Output is correct
6 Correct 32 ms 122456 KB Output is correct
7 Correct 31 ms 122448 KB Output is correct
8 Correct 30 ms 121588 KB Output is correct
9 Correct 29 ms 121432 KB Output is correct
10 Correct 33 ms 121424 KB Output is correct
11 Correct 28 ms 121652 KB Output is correct
12 Correct 27 ms 121680 KB Output is correct
13 Correct 27 ms 121688 KB Output is correct
14 Correct 28 ms 121892 KB Output is correct
15 Correct 30 ms 121688 KB Output is correct
16 Correct 27 ms 121684 KB Output is correct
17 Correct 28 ms 121944 KB Output is correct
18 Correct 31 ms 121988 KB Output is correct
19 Correct 32 ms 122140 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 121424 KB Output is correct
2 Correct 31 ms 121688 KB Output is correct
3 Correct 29 ms 122456 KB Output is correct
4 Correct 28 ms 121632 KB Output is correct
5 Correct 29 ms 122456 KB Output is correct
6 Correct 32 ms 122456 KB Output is correct
7 Correct 31 ms 122448 KB Output is correct
8 Correct 30 ms 121588 KB Output is correct
9 Correct 29 ms 121432 KB Output is correct
10 Correct 33 ms 121424 KB Output is correct
11 Correct 28 ms 121652 KB Output is correct
12 Correct 27 ms 121680 KB Output is correct
13 Correct 27 ms 121688 KB Output is correct
14 Correct 28 ms 121892 KB Output is correct
15 Correct 30 ms 121688 KB Output is correct
16 Correct 27 ms 121684 KB Output is correct
17 Correct 28 ms 121944 KB Output is correct
18 Correct 31 ms 121988 KB Output is correct
19 Correct 32 ms 122140 KB Output is correct
20 Correct 29 ms 125272 KB Output is correct
21 Correct 31 ms 123904 KB Output is correct
22 Correct 44 ms 133324 KB Output is correct
23 Correct 35 ms 125924 KB Output is correct
24 Correct 159 ms 165432 KB Output is correct
25 Correct 104 ms 148764 KB Output is correct
26 Correct 59 ms 136856 KB Output is correct
27 Correct 140 ms 173104 KB Output is correct
28 Correct 101 ms 164324 KB Output is correct
29 Correct 148 ms 169560 KB Output is correct

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 121424 KB Output is correct
2 Correct 31 ms 121688 KB Output is correct
3 Correct 29 ms 122456 KB Output is correct
4 Correct 28 ms 121632 KB Output is correct
5 Correct 29 ms 122456 KB Output is correct
6 Correct 32 ms 122456 KB Output is correct
7 Correct 31 ms 122448 KB Output is correct
8 Correct 30 ms 121588 KB Output is correct
9 Correct 29 ms 121432 KB Output is correct
10 Correct 33 ms 121424 KB Output is correct
11 Correct 28 ms 121652 KB Output is correct
12 Correct 27 ms 121680 KB Output is correct
13 Correct 27 ms 121688 KB Output is correct
14 Correct 28 ms 121892 KB Output is correct
15 Correct 30 ms 121688 KB Output is correct
16 Correct 27 ms 121684 KB Output is correct
17 Correct 28 ms 121944 KB Output is correct
18 Correct 31 ms 121988 KB Output is correct
19 Correct 32 ms 122140 KB Output is correct
20 Correct 29 ms 125272 KB Output is correct
21 Correct 31 ms 123904 KB Output is correct
22 Correct 44 ms 133324 KB Output is correct
23 Correct 35 ms 125924 KB Output is correct
24 Correct 159 ms 165432 KB Output is correct
25 Correct 104 ms 148764 KB Output is correct
26 Correct 59 ms 136856 KB Output is correct
27 Correct 140 ms 173104 KB Output is correct
28 Correct 101 ms 164324 KB Output is correct
29 Correct 148 ms 169560 KB Output is correct
30 Runtime error 113 ms 247732 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 121424 KB Output is correct
2 Correct 31 ms 121688 KB Output is correct
3 Correct 29 ms 122456 KB Output is correct
4 Correct 28 ms 121632 KB Output is correct
5 Correct 29 ms 122456 KB Output is correct
6 Correct 32 ms 122456 KB Output is correct
7 Correct 31 ms 122448 KB Output is correct
8 Correct 30 ms 121588 KB Output is correct
9 Correct 29 ms 121432 KB Output is correct
10 Correct 33 ms 121424 KB Output is correct
11 Correct 28 ms 121652 KB Output is correct
12 Correct 27 ms 121680 KB Output is correct
13 Correct 27 ms 121688 KB Output is correct
14 Correct 28 ms 121892 KB Output is correct
15 Correct 30 ms 121688 KB Output is correct
16 Correct 27 ms 121684 KB Output is correct
17 Correct 28 ms 121944 KB Output is correct
18 Correct 31 ms 121988 KB Output is correct
19 Correct 32 ms 122140 KB Output is correct
20 Correct 29 ms 125272 KB Output is correct
21 Correct 31 ms 123904 KB Output is correct
22 Correct 44 ms 133324 KB Output is correct
23 Correct 35 ms 125924 KB Output is correct
24 Correct 159 ms 165432 KB Output is correct
25 Correct 104 ms 148764 KB Output is correct
26 Correct 59 ms 136856 KB Output is correct
27 Correct 140 ms 173104 KB Output is correct
28 Correct 101 ms 164324 KB Output is correct
29 Correct 148 ms 169560 KB Output is correct
30 Runtime error 113 ms 247732 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -