답안 #983868

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
983868	2024-05-16T07:32:57 Z	vjudge1	게임 (APIO22_game)	C++17	30 / 100	104 ms	101900 KB

game

#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 = 1e3 + 9 , mod = 1e9 + 7;
bool a[N][1009][2];
vector<int>v[N][1009][2] ;

int n , k;
int ans = 0;

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



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])
                v[i][j][0].pb(i + 1);
            if(!a[i][j][1])
                v[i + 1][j][1].pb(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])
            ::v[x][i][0].pb(y);
        if(!a[x][i][1])
            ::v[y][i][1].pb(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_teleport(3 , 4)<<"\n";
    cout<<add_teleport(5 , 0)<<"\n";
    cout<<add_teleport(4 , 5)<<"\n";
    cout<<add_teleport(5 , 3)<<"\n";
    cout<<add_teleport(1 , 4)<<"\n";

}*/
// Author : حسن

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	49752 KB	Output is correct
2	Correct	11 ms	49752 KB	Output is correct
3	Correct	13 ms	50520 KB	Output is correct
4	Correct	12 ms	49752 KB	Output is correct
5	Correct	13 ms	50520 KB	Output is correct
6	Correct	13 ms	50520 KB	Output is correct
7	Correct	13 ms	50520 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	49752 KB	Output is correct
2	Correct	11 ms	49752 KB	Output is correct
3	Correct	13 ms	50520 KB	Output is correct
4	Correct	12 ms	49752 KB	Output is correct
5	Correct	13 ms	50520 KB	Output is correct
6	Correct	13 ms	50520 KB	Output is correct
7	Correct	13 ms	50520 KB	Output is correct
8	Correct	11 ms	49752 KB	Output is correct
9	Correct	11 ms	49752 KB	Output is correct
10	Correct	11 ms	49752 KB	Output is correct
11	Correct	12 ms	49752 KB	Output is correct
12	Correct	11 ms	49752 KB	Output is correct
13	Correct	11 ms	49752 KB	Output is correct
14	Correct	12 ms	50008 KB	Output is correct
15	Correct	12 ms	49828 KB	Output is correct
16	Correct	11 ms	49752 KB	Output is correct
17	Correct	12 ms	50048 KB	Output is correct
18	Correct	12 ms	50008 KB	Output is correct
19	Correct	12 ms	50108 KB	Output is correct

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	49752 KB	Output is correct
2	Correct	11 ms	49752 KB	Output is correct
3	Correct	13 ms	50520 KB	Output is correct
4	Correct	12 ms	49752 KB	Output is correct
5	Correct	13 ms	50520 KB	Output is correct
6	Correct	13 ms	50520 KB	Output is correct
7	Correct	13 ms	50520 KB	Output is correct
8	Correct	11 ms	49752 KB	Output is correct
9	Correct	11 ms	49752 KB	Output is correct
10	Correct	11 ms	49752 KB	Output is correct
11	Correct	12 ms	49752 KB	Output is correct
12	Correct	11 ms	49752 KB	Output is correct
13	Correct	11 ms	49752 KB	Output is correct
14	Correct	12 ms	50008 KB	Output is correct
15	Correct	12 ms	49828 KB	Output is correct
16	Correct	11 ms	49752 KB	Output is correct
17	Correct	12 ms	50048 KB	Output is correct
18	Correct	12 ms	50008 KB	Output is correct
19	Correct	12 ms	50108 KB	Output is correct
20	Correct	13 ms	50264 KB	Output is correct
21	Correct	14 ms	51032 KB	Output is correct
22	Correct	24 ms	56152 KB	Output is correct
23	Correct	13 ms	50520 KB	Output is correct
24	Correct	104 ms	81804 KB	Output is correct
25	Correct	63 ms	65532 KB	Output is correct
26	Correct	39 ms	57664 KB	Output is correct
27	Correct	97 ms	80452 KB	Output is correct
28	Correct	68 ms	74176 KB	Output is correct
29	Correct	91 ms	78052 KB	Output is correct

Subtask #4
0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	49752 KB	Output is correct
2	Correct	11 ms	49752 KB	Output is correct
3	Correct	13 ms	50520 KB	Output is correct
4	Correct	12 ms	49752 KB	Output is correct
5	Correct	13 ms	50520 KB	Output is correct
6	Correct	13 ms	50520 KB	Output is correct
7	Correct	13 ms	50520 KB	Output is correct
8	Correct	11 ms	49752 KB	Output is correct
9	Correct	11 ms	49752 KB	Output is correct
10	Correct	11 ms	49752 KB	Output is correct
11	Correct	12 ms	49752 KB	Output is correct
12	Correct	11 ms	49752 KB	Output is correct
13	Correct	11 ms	49752 KB	Output is correct
14	Correct	12 ms	50008 KB	Output is correct
15	Correct	12 ms	49828 KB	Output is correct
16	Correct	11 ms	49752 KB	Output is correct
17	Correct	12 ms	50048 KB	Output is correct
18	Correct	12 ms	50008 KB	Output is correct
19	Correct	12 ms	50108 KB	Output is correct
20	Correct	13 ms	50264 KB	Output is correct
21	Correct	14 ms	51032 KB	Output is correct
22	Correct	24 ms	56152 KB	Output is correct
23	Correct	13 ms	50520 KB	Output is correct
24	Correct	104 ms	81804 KB	Output is correct
25	Correct	63 ms	65532 KB	Output is correct
26	Correct	39 ms	57664 KB	Output is correct
27	Correct	97 ms	80452 KB	Output is correct
28	Correct	68 ms	74176 KB	Output is correct
29	Correct	91 ms	78052 KB	Output is correct
30	Runtime error	47 ms	101900 KB	Execution killed with signal 11
31	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	49752 KB	Output is correct
2	Correct	11 ms	49752 KB	Output is correct
3	Correct	13 ms	50520 KB	Output is correct
4	Correct	12 ms	49752 KB	Output is correct
5	Correct	13 ms	50520 KB	Output is correct
6	Correct	13 ms	50520 KB	Output is correct
7	Correct	13 ms	50520 KB	Output is correct
8	Correct	11 ms	49752 KB	Output is correct
9	Correct	11 ms	49752 KB	Output is correct
10	Correct	11 ms	49752 KB	Output is correct
11	Correct	12 ms	49752 KB	Output is correct
12	Correct	11 ms	49752 KB	Output is correct
13	Correct	11 ms	49752 KB	Output is correct
14	Correct	12 ms	50008 KB	Output is correct
15	Correct	12 ms	49828 KB	Output is correct
16	Correct	11 ms	49752 KB	Output is correct
17	Correct	12 ms	50048 KB	Output is correct
18	Correct	12 ms	50008 KB	Output is correct
19	Correct	12 ms	50108 KB	Output is correct
20	Correct	13 ms	50264 KB	Output is correct
21	Correct	14 ms	51032 KB	Output is correct
22	Correct	24 ms	56152 KB	Output is correct
23	Correct	13 ms	50520 KB	Output is correct
24	Correct	104 ms	81804 KB	Output is correct
25	Correct	63 ms	65532 KB	Output is correct
26	Correct	39 ms	57664 KB	Output is correct
27	Correct	97 ms	80452 KB	Output is correct
28	Correct	68 ms	74176 KB	Output is correct
29	Correct	91 ms	78052 KB	Output is correct
30	Runtime error	47 ms	101900 KB	Execution killed with signal 11
31	Halted	0 ms	0 KB	-

답안 #983868

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 10.0 / 10.0

Subtask #3 18.0 / 18.0

Subtask #4 0.0 / 30.0

Subtask #5 0.0 / 40.0

Subtask #1
2.0 / 2.0

Subtask #2
10.0 / 10.0

Subtask #3
18.0 / 18.0

Subtask #4
0.0 / 30.0

Subtask #5
0.0 / 40.0