답안 #717029

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

game

#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 <short, short> 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); }
vector<int> adj[30005];
bitset<30005> d1[1005];
short n, k;
void dfs(short s, short x){
    for(auto v:adj[x]) {
        if(d1[s][v]==0){
            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;
            adj[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	1 ms	976 KB	Output is correct
2	Correct	1 ms	976 KB	Output is correct
3	Correct	1 ms	1488 KB	Output is correct
4	Correct	1 ms	1104 KB	Output is correct
5	Correct	1 ms	1488 KB	Output is correct
6	Correct	1 ms	1488 KB	Output is correct
7	Correct	1 ms	1488 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	976 KB	Output is correct
2	Correct	1 ms	976 KB	Output is correct
3	Correct	1 ms	1488 KB	Output is correct
4	Correct	1 ms	1104 KB	Output is correct
5	Correct	1 ms	1488 KB	Output is correct
6	Correct	1 ms	1488 KB	Output is correct
7	Correct	1 ms	1488 KB	Output is correct
8	Correct	1 ms	976 KB	Output is correct
9	Correct	1 ms	976 KB	Output is correct
10	Correct	1 ms	976 KB	Output is correct
11	Correct	1 ms	976 KB	Output is correct
12	Correct	1 ms	1024 KB	Output is correct
13	Correct	1 ms	976 KB	Output is correct
14	Correct	1 ms	1104 KB	Output is correct
15	Correct	1 ms	1104 KB	Output is correct
16	Correct	1 ms	976 KB	Output is correct
17	Correct	1 ms	1232 KB	Output is correct
18	Correct	1 ms	1232 KB	Output is correct
19	Correct	1 ms	1232 KB	Output is correct

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	976 KB	Output is correct
2	Correct	1 ms	976 KB	Output is correct
3	Correct	1 ms	1488 KB	Output is correct
4	Correct	1 ms	1104 KB	Output is correct
5	Correct	1 ms	1488 KB	Output is correct
6	Correct	1 ms	1488 KB	Output is correct
7	Correct	1 ms	1488 KB	Output is correct
8	Correct	1 ms	976 KB	Output is correct
9	Correct	1 ms	976 KB	Output is correct
10	Correct	1 ms	976 KB	Output is correct
11	Correct	1 ms	976 KB	Output is correct
12	Correct	1 ms	1024 KB	Output is correct
13	Correct	1 ms	976 KB	Output is correct
14	Correct	1 ms	1104 KB	Output is correct
15	Correct	1 ms	1104 KB	Output is correct
16	Correct	1 ms	976 KB	Output is correct
17	Correct	1 ms	1232 KB	Output is correct
18	Correct	1 ms	1232 KB	Output is correct
19	Correct	1 ms	1232 KB	Output is correct
20	Correct	2 ms	1104 KB	Output is correct
21	Correct	1 ms	1360 KB	Output is correct
22	Correct	7 ms	1844 KB	Output is correct
23	Correct	2 ms	1108 KB	Output is correct
24	Correct	71 ms	4676 KB	Output is correct
25	Correct	24 ms	6316 KB	Output is correct
26	Correct	29 ms	3120 KB	Output is correct
27	Correct	118 ms	7616 KB	Output is correct
28	Correct	29 ms	7084 KB	Output is correct
29	Correct	49 ms	9680 KB	Output is correct

Subtask #4
0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	976 KB	Output is correct
2	Correct	1 ms	976 KB	Output is correct
3	Correct	1 ms	1488 KB	Output is correct
4	Correct	1 ms	1104 KB	Output is correct
5	Correct	1 ms	1488 KB	Output is correct
6	Correct	1 ms	1488 KB	Output is correct
7	Correct	1 ms	1488 KB	Output is correct
8	Correct	1 ms	976 KB	Output is correct
9	Correct	1 ms	976 KB	Output is correct
10	Correct	1 ms	976 KB	Output is correct
11	Correct	1 ms	976 KB	Output is correct
12	Correct	1 ms	1024 KB	Output is correct
13	Correct	1 ms	976 KB	Output is correct
14	Correct	1 ms	1104 KB	Output is correct
15	Correct	1 ms	1104 KB	Output is correct
16	Correct	1 ms	976 KB	Output is correct
17	Correct	1 ms	1232 KB	Output is correct
18	Correct	1 ms	1232 KB	Output is correct
19	Correct	1 ms	1232 KB	Output is correct
20	Correct	2 ms	1104 KB	Output is correct
21	Correct	1 ms	1360 KB	Output is correct
22	Correct	7 ms	1844 KB	Output is correct
23	Correct	2 ms	1108 KB	Output is correct
24	Correct	71 ms	4676 KB	Output is correct
25	Correct	24 ms	6316 KB	Output is correct
26	Correct	29 ms	3120 KB	Output is correct
27	Correct	118 ms	7616 KB	Output is correct
28	Correct	29 ms	7084 KB	Output is correct
29	Correct	49 ms	9680 KB	Output is correct
30	Correct	53 ms	16780 KB	Output is correct
31	Correct	87 ms	34008 KB	Output is correct
32	Correct	205 ms	16960 KB	Output is correct
33	Correct	24 ms	3364 KB	Output is correct
34	Execution timed out	4054 ms	123552 KB	Time limit exceeded
35	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	976 KB	Output is correct
2	Correct	1 ms	976 KB	Output is correct
3	Correct	1 ms	1488 KB	Output is correct
4	Correct	1 ms	1104 KB	Output is correct
5	Correct	1 ms	1488 KB	Output is correct
6	Correct	1 ms	1488 KB	Output is correct
7	Correct	1 ms	1488 KB	Output is correct
8	Correct	1 ms	976 KB	Output is correct
9	Correct	1 ms	976 KB	Output is correct
10	Correct	1 ms	976 KB	Output is correct
11	Correct	1 ms	976 KB	Output is correct
12	Correct	1 ms	1024 KB	Output is correct
13	Correct	1 ms	976 KB	Output is correct
14	Correct	1 ms	1104 KB	Output is correct
15	Correct	1 ms	1104 KB	Output is correct
16	Correct	1 ms	976 KB	Output is correct
17	Correct	1 ms	1232 KB	Output is correct
18	Correct	1 ms	1232 KB	Output is correct
19	Correct	1 ms	1232 KB	Output is correct
20	Correct	2 ms	1104 KB	Output is correct
21	Correct	1 ms	1360 KB	Output is correct
22	Correct	7 ms	1844 KB	Output is correct
23	Correct	2 ms	1108 KB	Output is correct
24	Correct	71 ms	4676 KB	Output is correct
25	Correct	24 ms	6316 KB	Output is correct
26	Correct	29 ms	3120 KB	Output is correct
27	Correct	118 ms	7616 KB	Output is correct
28	Correct	29 ms	7084 KB	Output is correct
29	Correct	49 ms	9680 KB	Output is correct
30	Correct	53 ms	16780 KB	Output is correct
31	Correct	87 ms	34008 KB	Output is correct
32	Correct	205 ms	16960 KB	Output is correct
33	Correct	24 ms	3364 KB	Output is correct
34	Execution timed out	4054 ms	123552 KB	Time limit exceeded
35	Halted	0 ms	0 KB	-

답안 #717029

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