Submission #1179667

#TimeUsernameProblemLanguageResultExecution timeMemory
1179667omar1312Game (IOI14_game)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int mod = 998244353, N = 1002; ll a[N+2]; set<int> adj[N+2]; map<array<int, 2>, bool> seen, val; void initialize(int n){ for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ if(i == j)continue; adj[i].insert(j); } } } int hasEdge(int u, int v){ if(seen[{u, v}])return val[{u, v}]; seen[{u, v}] = 1; adj[u].erase(adj[u].find(v)); adj[v].erase(adj[v].find(u)); if(!adj[u].size() || !adj[v].size()){ val[{u, v}] = 1; return 1; } else return 0; } // int main(){ // cin.tie(0)->sync_with_stdio(0); // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...