oj.uz

Submission #983876

# Submission time Handle Problem Language Result Execution time Memory
983876 2024-05-16T07:39:24 Z vjudge1 Game (APIO22_game) C++17
2 / 100
 4 ms 7868 KB 
#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>

#include "game.h"
#define ll long long
using namespace std;
vector<int> g[300005];
bool ok = 0, f = 0;;
bool us[300005], c[300005];
int N, K;
void dfs(int p){
  us[p] = 1;
  for(int to : g[p]){
    if(c[to] == 1 && us[to] == 1) f = 1;
    if(us[to]) continue;
    dfs(to);
  }
}
void init(int n, int k){
  for(int i = 0; i < k - 1; i++)
    g[i].push_back(i + 1);
  N = n;
  K = k;
}
int add_teleporter(int u, int v) {
  if(ok) return 1;
  if(u < K && v < K && u >= v){
    ok = 1;
    return 1;
  }
  if(u < K && v < K) return 0;
  g[u].push_back(v);
  f = 0;
  if(v < K) c[u] = 1;
  for(int i = 0; i <= N; i++) us[i] = 0;
  dfs(0);
  if(f == 1){
    ok = 1;
    return 1;
  }
  return 0;
}
// int a, b, t;
// int main(){
//   cin >> a >> t;

//   cin >> b;
//   init(a, b);
//   while(t--){
//     int x, y;
//     cin >> x >> y;
//     cout << add_teleporter(x, y) << "\n";
//   }
// }

Subtask #1
2.0 / 2.0

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

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 3 ms 7768 KB Output is correct
3 Correct 2 ms 7768 KB Output is correct
4 Correct 4 ms 7868 KB Output is correct
5 Correct 3 ms 7768 KB Output is correct
6 Correct 2 ms 7768 KB Output is correct
7 Correct 2 ms 7768 KB Output is correct
8 Incorrect 2 ms 7768 KB Wrong Answer[1]
9 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 3 ms 7768 KB Output is correct
3 Correct 2 ms 7768 KB Output is correct
4 Correct 4 ms 7868 KB Output is correct
5 Correct 3 ms 7768 KB Output is correct
6 Correct 2 ms 7768 KB Output is correct
7 Correct 2 ms 7768 KB Output is correct
8 Incorrect 2 ms 7768 KB Wrong Answer[1]
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 3 ms 7768 KB Output is correct
3 Correct 2 ms 7768 KB Output is correct
4 Correct 4 ms 7868 KB Output is correct
5 Correct 3 ms 7768 KB Output is correct
6 Correct 2 ms 7768 KB Output is correct
7 Correct 2 ms 7768 KB Output is correct
8 Incorrect 2 ms 7768 KB Wrong Answer[1]
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 3 ms 7768 KB Output is correct
3 Correct 2 ms 7768 KB Output is correct
4 Correct 4 ms 7868 KB Output is correct
5 Correct 3 ms 7768 KB Output is correct
6 Correct 2 ms 7768 KB Output is correct
7 Correct 2 ms 7768 KB Output is correct
8 Incorrect 2 ms 7768 KB Wrong Answer[1]
9 Halted 0 ms 0 KB -