oj.uz

Submission #345612

# Submission time Handle Problem Language Result Execution time Memory
345612 2021-01-07T16:22:24 Z NicolaAbusaad2014 Game (IOI14_game) C++14
0 / 100
 1 ms 384 KB 
/**
 * Prof.Nicola
**/
#include "game.h"
#include <bits/stdc++.h>

using namespace std;
template<class T>void re(T&x){cin>>x;}
template<class T1,class T2> void re(pair<T1,T2>&x){re(x.first);re(x.second);}
template<class T>void re(vector<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
template<class T>void re(deque<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
template<class T1,class T2> pair<T1,T2> mp(T1&x,T2&z){return make_pair(x,z);}
long nodes;
vector<long>m;
void initialize(int n) {
    nodes=n;
    m.resize(n);
    for(long i=0;i<n;i++){
        m[i]=n;
    }
}

int hasEdge(int u, int v) {
    m[u]--;
    m[v]--;
    if((!m[u])||(!m[v])){
        return 1;
    }
    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 268 KB Output isn't correct
2 Halted 0 ms 0 KB -