oj.uz

Submission #752624

# Submission time Handle Problem Language Result Execution time Memory
752624 2023-06-03T10:19:13 Z Dan4Life Game (APIO22_game) C++17
2 / 100
 128 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int mxN = (int)2e5+10;
int n, k, sm[mxN], bg[mxN];
vector<int> adj[mxN], radj[mxN];
 
void init(int N, int K) {
    n = N; k = K;
    for(int i = 0; i < k; i++) 
        sm[i]=bg[i] =i;
    for(int i = k; i < n; i++)
        sm[i] = n, bg[i] = -1;
}
 
void dfs(int s, int c, vector<int> adj[], bool ok){ 
    if(ok){
        if(c>=k) return;
        //if(bg[s]>=c) return;
        bg[s] = c;
    }
    else{
        if(sm[s]<=c) return;
        sm[s] = c;
    }
    for(auto u : adj[s]) dfs(u,c,adj,ok);
}
 
int add_teleporter(int u, int v) {
    if(u>=v and u<k) return 1;
    if(max(u,v)<k) return 0;
    adj[u].pb(v), radj[v].pb(u);
    dfs(u, sm[v], radj,0), dfs(v,bg[u], adj,1); 
    return (sm[v]<=bg[u] and bg[u]<k);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 5 ms 9680 KB Output is correct
3 Correct 5 ms 9656 KB Output is correct
4 Correct 6 ms 9680 KB Output is correct
5 Correct 5 ms 9680 KB Output is correct
6 Correct 5 ms 9680 KB Output is correct
7 Correct 5 ms 9680 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 5 ms 9680 KB Output is correct
3 Correct 5 ms 9656 KB Output is correct
4 Correct 6 ms 9680 KB Output is correct
5 Correct 5 ms 9680 KB Output is correct
6 Correct 5 ms 9680 KB Output is correct
7 Correct 5 ms 9680 KB Output is correct
8 Runtime error 128 ms 262144 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 5 ms 9680 KB Output is correct
3 Correct 5 ms 9656 KB Output is correct
4 Correct 6 ms 9680 KB Output is correct
5 Correct 5 ms 9680 KB Output is correct
6 Correct 5 ms 9680 KB Output is correct
7 Correct 5 ms 9680 KB Output is correct
8 Runtime error 128 ms 262144 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 5 ms 9680 KB Output is correct
3 Correct 5 ms 9656 KB Output is correct
4 Correct 6 ms 9680 KB Output is correct
5 Correct 5 ms 9680 KB Output is correct
6 Correct 5 ms 9680 KB Output is correct
7 Correct 5 ms 9680 KB Output is correct
8 Runtime error 128 ms 262144 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 5 ms 9680 KB Output is correct
3 Correct 5 ms 9656 KB Output is correct
4 Correct 6 ms 9680 KB Output is correct
5 Correct 5 ms 9680 KB Output is correct
6 Correct 5 ms 9680 KB Output is correct
7 Correct 5 ms 9680 KB Output is correct
8 Runtime error 128 ms 262144 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -