답안 #717022

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
717022	2023-03-31T23:01:22 Z	sunwukong123	게임 (APIO22_game)	C++17	30 / 100	1123 ms	262144 KB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach 
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
unordered_map<short,vector<short>> adj1[1005];
bitset<30005> d1[1005];
int n, k;
void dfs(int s, int x){
    for(auto v:adj1[s][x]) {
        if(d1[s][v])continue;
        d1[s][v]=1;
        dfs(s,v);
    }
}
void init(int N, int K) {
    reach
    n=N;
    k=K;
    FOR(i,0,k-1) {
        FOR(j,i+1,k-1) {
            d1[i][j]=1;
        }
    }
}

int add_teleporter(int u, int v) {
    FOR(s,0,k-1) {
        if(d1[s][u] | (s==u)) {
            if(!d1[s][v]) {
                d1[s][v]=1;
                dfs(s,v);
            }
        } else {
            if(s==u)return 1;
            adj1[s][u].pb(v);
        }
    }
    FOR(i,0,k-1){
        if(d1[i][i])return 1;
    }


    return 0;
}

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	2 ms	1104 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	2 ms	1104 KB	Output is correct
6	Correct	2 ms	1104 KB	Output is correct
7	Correct	2 ms	1124 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	2 ms	1104 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	2 ms	1104 KB	Output is correct
6	Correct	2 ms	1104 KB	Output is correct
7	Correct	2 ms	1124 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	336 KB	Output is correct
10	Correct	0 ms	336 KB	Output is correct
11	Correct	1 ms	464 KB	Output is correct
12	Correct	1 ms	464 KB	Output is correct
13	Correct	1 ms	464 KB	Output is correct
14	Correct	1 ms	848 KB	Output is correct
15	Correct	1 ms	592 KB	Output is correct
16	Correct	1 ms	464 KB	Output is correct
17	Correct	2 ms	844 KB	Output is correct
18	Correct	1 ms	720 KB	Output is correct
19	Correct	1 ms	720 KB	Output is correct

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	2 ms	1104 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	2 ms	1104 KB	Output is correct
6	Correct	2 ms	1104 KB	Output is correct
7	Correct	2 ms	1124 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	336 KB	Output is correct
10	Correct	0 ms	336 KB	Output is correct
11	Correct	1 ms	464 KB	Output is correct
12	Correct	1 ms	464 KB	Output is correct
13	Correct	1 ms	464 KB	Output is correct
14	Correct	1 ms	848 KB	Output is correct
15	Correct	1 ms	592 KB	Output is correct
16	Correct	1 ms	464 KB	Output is correct
17	Correct	2 ms	844 KB	Output is correct
18	Correct	1 ms	720 KB	Output is correct
19	Correct	1 ms	720 KB	Output is correct
20	Correct	2 ms	976 KB	Output is correct
21	Correct	3 ms	1872 KB	Output is correct
22	Correct	37 ms	8452 KB	Output is correct
23	Correct	3 ms	1232 KB	Output is correct
24	Correct	102 ms	33408 KB	Output is correct
25	Correct	97 ms	20444 KB	Output is correct
26	Correct	35 ms	8520 KB	Output is correct
27	Correct	156 ms	32708 KB	Output is correct
28	Correct	81 ms	21320 KB	Output is correct
29	Correct	166 ms	33148 KB	Output is correct

Subtask #4
0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	2 ms	1104 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	2 ms	1104 KB	Output is correct
6	Correct	2 ms	1104 KB	Output is correct
7	Correct	2 ms	1124 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	336 KB	Output is correct
10	Correct	0 ms	336 KB	Output is correct
11	Correct	1 ms	464 KB	Output is correct
12	Correct	1 ms	464 KB	Output is correct
13	Correct	1 ms	464 KB	Output is correct
14	Correct	1 ms	848 KB	Output is correct
15	Correct	1 ms	592 KB	Output is correct
16	Correct	1 ms	464 KB	Output is correct
17	Correct	2 ms	844 KB	Output is correct
18	Correct	1 ms	720 KB	Output is correct
19	Correct	1 ms	720 KB	Output is correct
20	Correct	2 ms	976 KB	Output is correct
21	Correct	3 ms	1872 KB	Output is correct
22	Correct	37 ms	8452 KB	Output is correct
23	Correct	3 ms	1232 KB	Output is correct
24	Correct	102 ms	33408 KB	Output is correct
25	Correct	97 ms	20444 KB	Output is correct
26	Correct	35 ms	8520 KB	Output is correct
27	Correct	156 ms	32708 KB	Output is correct
28	Correct	81 ms	21320 KB	Output is correct
29	Correct	166 ms	33148 KB	Output is correct
30	Correct	1123 ms	163072 KB	Output is correct
31	Runtime error	796 ms	262144 KB	Execution killed with signal 9
32	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	2 ms	1104 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	2 ms	1104 KB	Output is correct
6	Correct	2 ms	1104 KB	Output is correct
7	Correct	2 ms	1124 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	336 KB	Output is correct
10	Correct	0 ms	336 KB	Output is correct
11	Correct	1 ms	464 KB	Output is correct
12	Correct	1 ms	464 KB	Output is correct
13	Correct	1 ms	464 KB	Output is correct
14	Correct	1 ms	848 KB	Output is correct
15	Correct	1 ms	592 KB	Output is correct
16	Correct	1 ms	464 KB	Output is correct
17	Correct	2 ms	844 KB	Output is correct
18	Correct	1 ms	720 KB	Output is correct
19	Correct	1 ms	720 KB	Output is correct
20	Correct	2 ms	976 KB	Output is correct
21	Correct	3 ms	1872 KB	Output is correct
22	Correct	37 ms	8452 KB	Output is correct
23	Correct	3 ms	1232 KB	Output is correct
24	Correct	102 ms	33408 KB	Output is correct
25	Correct	97 ms	20444 KB	Output is correct
26	Correct	35 ms	8520 KB	Output is correct
27	Correct	156 ms	32708 KB	Output is correct
28	Correct	81 ms	21320 KB	Output is correct
29	Correct	166 ms	33148 KB	Output is correct
30	Correct	1123 ms	163072 KB	Output is correct
31	Runtime error	796 ms	262144 KB	Execution killed with signal 9
32	Halted	0 ms	0 KB	-

답안 #717022

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