oj.uz

Submission #576836

# Submission time Handle Problem Language Result Execution time Memory
576836 2022-06-13T15:53:52 Z Omar_Elgedawy Game (APIO22_game) C++17
2 / 100
 2 ms 976 KB 
#include <bits/stdc++.h>
using namespace std;
#define cin(vec)        for(auto& i : vec) cin >> i
#define cout(vec)       for(auto& i : vec) cout << i << " "; cout << "\n";
#define fast            ios::sync_with_stdio(0);cin.tie(0);
#define loop(i,a,b)     for (int i = a; i < b; i++)
#define F               first
#define S               second
#define pb(n)           push_back(n)
#define pf(n)           push_front(n)
#define dci(d)          fixed<<setprecision(d)
#define sp              ' '
#define el              '\n'
#define all(v)          v.begin(),v.end()
int const N=30005;
int n,k,vis[N],vid;
vector<int>g[N],mx;
int dfs(int u,int num){
  vis[u]=vid;
  if(u<k){
    if(u<num){
      return 1;
    }
    return 0;
  }
  int c=0;
  for(auto u:g[u]){
    if(vis[u]!=vid){
      vis[u]=vid;
      mx[u]=max(mx[u],num);
      c|=dfs(u,num);
    }
  }
  return c;
}
void init(int _n, int _k) {
  n=_n;k=_k;
  for(int i=0;i<k-1;i++)g[i].pb(i+1),mx.pb(i);
  mx.pb(k-1);
  for(int i=k;i<n;i++)mx.pb(0);
}
int add_teleporter(int u, int v) {
  if(u<k&&v<k){
    if(v<=u)return 1;
  }
  else if(u==v){
  }
  else{
    g[u].pb(v);
    if(v<k){
      if(mx[u]>v){
        return 1;
      }
    }
    else{
      vid++;
      if(dfs(u,mx[u])){
        return 1;
      }
    }
  }
  return 0;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
0.0 / 10.0

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

Subtask #3
0.0 / 18.0

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

Subtask #4
0.0 / 30.0

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

Subtask #5
0.0 / 40.0

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