oj.uz

Submission #982768

# Submission time Handle Problem Language Result Execution time Memory
982768 2024-05-14T17:33:45 Z vjudge1 Game (APIO22_game) C++17
0 / 100
 0 ms 344 KB 
#include "game.h"

// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<lli,lli> ii;
typedef vector<lli> vi;
typedef vector<ii> vii;
#define deb(x) cout << #x": " << (x) << endl;

lli N, K;

void init(int n, int k){
  N = n, K = k;
}

int add_teleporter(int u, int v){
  if (v < u) return 1;
  else return 0;
}

// int main(){ _
//   // freopen("file.in","r",stdin);
//   // freopen("file.out","w",stdout);
//   lli n, m, k; cin >> n >> m >> k;
//   init(n, k);
//   fore(i,0,m){
//     lli a, b; cin >> a >> b;
//     cout << a << ' ' << b << ' ';
//     if (add_teleporter(a, b)) {cout << 1 << ENDL; return 0; }
//     else cout << 0 << ENDL;
//   }
//   return 0;
// }

Subtask #1
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -