oj.uz

답안 #710331

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710331 2023-03-15T07:25:17 Z Astrayt 게임 (APIO22_game) C++17
0 / 100
 4000 ms 14288 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define maxn 300005

int N, K, good = 0, t = 1, low[maxn];
vector<int> adj[maxn], rev[maxn];

void init(int n, int k){
    N = n, K = k;
    for(int i = 0; i < k - 1; ++i) adj[i].pb(i + 1), rev[i + 1].pb(i);
    for(int i = 0; i < n; ++i) low[i] = i;
}

int add_teleporter(int u, int v){
    if(u == v){
        if(u < K) return 1;
        else return 0;
    }
    bool ok = 1;
    adj[u].pb(v);
    adj[v].pb(u);
    low[u] = min(low[v], low[u]);
    queue<int> bfs; bfs.push(u);
    while(bfs.size()){
        int u = bfs.front();
        for(auto v:adj[u]){
            if(low[v] > low[u]) {
                low[v] = low[u];
                bfs.push(v);
            }
        }
    }
    if(u < K && low[u] < u) return 1;
    return 0;
}

Compilation message

game.cpp: In function 'int add_teleporter(int, int)':
game.cpp:21:10: warning: unused variable 'ok' [-Wunused-variable]
   21 |     bool ok = 1;
      |          ^~

Subtask #1
0.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Execution timed out 4075 ms 14288 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Execution timed out 4075 ms 14288 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Execution timed out 4075 ms 14288 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Execution timed out 4075 ms 14288 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Execution timed out 4075 ms 14288 KB Time limit exceeded
3 Halted 0 ms 0 KB -