oj.uz

Submission #983891

# Submission time Handle Problem Language Result Execution time Memory
983891 2024-05-16T07:47:21 Z vjudge1 Game (APIO22_game) C++17
30 / 100
 160 ms 247776 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];
    }
    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 47 ms 121424 KB Output is correct
2 Correct 30 ms 121688 KB Output is correct
3 Correct 30 ms 122456 KB Output is correct
4 Correct 28 ms 121752 KB Output is correct
5 Correct 29 ms 122456 KB Output is correct
6 Correct 30 ms 122452 KB Output is correct
7 Correct 33 ms 122464 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 121424 KB Output is correct
2 Correct 30 ms 121688 KB Output is correct
3 Correct 30 ms 122456 KB Output is correct
4 Correct 28 ms 121752 KB Output is correct
5 Correct 29 ms 122456 KB Output is correct
6 Correct 30 ms 122452 KB Output is correct
7 Correct 33 ms 122464 KB Output is correct
8 Correct 33 ms 121600 KB Output is correct
9 Correct 27 ms 121424 KB Output is correct
10 Correct 27 ms 121688 KB Output is correct
11 Correct 27 ms 121688 KB Output is correct
12 Correct 28 ms 121680 KB Output is correct
13 Correct 27 ms 121688 KB Output is correct
14 Correct 31 ms 122200 KB Output is correct
15 Correct 27 ms 121688 KB Output is correct
16 Correct 27 ms 121684 KB Output is correct
17 Correct 27 ms 121944 KB Output is correct
18 Correct 30 ms 121936 KB Output is correct
19 Correct 28 ms 121944 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 121424 KB Output is correct
2 Correct 30 ms 121688 KB Output is correct
3 Correct 30 ms 122456 KB Output is correct
4 Correct 28 ms 121752 KB Output is correct
5 Correct 29 ms 122456 KB Output is correct
6 Correct 30 ms 122452 KB Output is correct
7 Correct 33 ms 122464 KB Output is correct
8 Correct 33 ms 121600 KB Output is correct
9 Correct 27 ms 121424 KB Output is correct
10 Correct 27 ms 121688 KB Output is correct
11 Correct 27 ms 121688 KB Output is correct
12 Correct 28 ms 121680 KB Output is correct
13 Correct 27 ms 121688 KB Output is correct
14 Correct 31 ms 122200 KB Output is correct
15 Correct 27 ms 121688 KB Output is correct
16 Correct 27 ms 121684 KB Output is correct
17 Correct 27 ms 121944 KB Output is correct
18 Correct 30 ms 121936 KB Output is correct
19 Correct 28 ms 121944 KB Output is correct
20 Correct 31 ms 125272 KB Output is correct
21 Correct 32 ms 123992 KB Output is correct
22 Correct 45 ms 133300 KB Output is correct
23 Correct 31 ms 125924 KB Output is correct
24 Correct 160 ms 166052 KB Output is correct
25 Correct 94 ms 148664 KB Output is correct
26 Correct 60 ms 136688 KB Output is correct
27 Correct 131 ms 172216 KB Output is correct
28 Correct 122 ms 164796 KB Output is correct
29 Correct 135 ms 171080 KB Output is correct

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 121424 KB Output is correct
2 Correct 30 ms 121688 KB Output is correct
3 Correct 30 ms 122456 KB Output is correct
4 Correct 28 ms 121752 KB Output is correct
5 Correct 29 ms 122456 KB Output is correct
6 Correct 30 ms 122452 KB Output is correct
7 Correct 33 ms 122464 KB Output is correct
8 Correct 33 ms 121600 KB Output is correct
9 Correct 27 ms 121424 KB Output is correct
10 Correct 27 ms 121688 KB Output is correct
11 Correct 27 ms 121688 KB Output is correct
12 Correct 28 ms 121680 KB Output is correct
13 Correct 27 ms 121688 KB Output is correct
14 Correct 31 ms 122200 KB Output is correct
15 Correct 27 ms 121688 KB Output is correct
16 Correct 27 ms 121684 KB Output is correct
17 Correct 27 ms 121944 KB Output is correct
18 Correct 30 ms 121936 KB Output is correct
19 Correct 28 ms 121944 KB Output is correct
20 Correct 31 ms 125272 KB Output is correct
21 Correct 32 ms 123992 KB Output is correct
22 Correct 45 ms 133300 KB Output is correct
23 Correct 31 ms 125924 KB Output is correct
24 Correct 160 ms 166052 KB Output is correct
25 Correct 94 ms 148664 KB Output is correct
26 Correct 60 ms 136688 KB Output is correct
27 Correct 131 ms 172216 KB Output is correct
28 Correct 122 ms 164796 KB Output is correct
29 Correct 135 ms 171080 KB Output is correct
30 Runtime error 130 ms 247776 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 47 ms 121424 KB Output is correct
2 Correct 30 ms 121688 KB Output is correct
3 Correct 30 ms 122456 KB Output is correct
4 Correct 28 ms 121752 KB Output is correct
5 Correct 29 ms 122456 KB Output is correct
6 Correct 30 ms 122452 KB Output is correct
7 Correct 33 ms 122464 KB Output is correct
8 Correct 33 ms 121600 KB Output is correct
9 Correct 27 ms 121424 KB Output is correct
10 Correct 27 ms 121688 KB Output is correct
11 Correct 27 ms 121688 KB Output is correct
12 Correct 28 ms 121680 KB Output is correct
13 Correct 27 ms 121688 KB Output is correct
14 Correct 31 ms 122200 KB Output is correct
15 Correct 27 ms 121688 KB Output is correct
16 Correct 27 ms 121684 KB Output is correct
17 Correct 27 ms 121944 KB Output is correct
18 Correct 30 ms 121936 KB Output is correct
19 Correct 28 ms 121944 KB Output is correct
20 Correct 31 ms 125272 KB Output is correct
21 Correct 32 ms 123992 KB Output is correct
22 Correct 45 ms 133300 KB Output is correct
23 Correct 31 ms 125924 KB Output is correct
24 Correct 160 ms 166052 KB Output is correct
25 Correct 94 ms 148664 KB Output is correct
26 Correct 60 ms 136688 KB Output is correct
27 Correct 131 ms 172216 KB Output is correct
28 Correct 122 ms 164796 KB Output is correct
29 Correct 135 ms 171080 KB Output is correct
30 Runtime error 130 ms 247776 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -