# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
879492 | Mr_Husanboy | Star triangles (IZhO11_triangle) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "game.h"
#include<bits/stdc++.h>
template<typename T>
int len(T &a){
return a.size();
}
using namespace std;
vector<int> cnt;
int cur, rem;
int n;
void initialize(int N){
n = N;
cnt.resize(n, n - 1);
cur = n - 1;
rem = (n - 1) * n / 2;
}
int hasEdge(int u, int v){
cnt[u] --; cnt[v] --;
rem --;
if(cnt[u] == n - 1) {cur --; return 1;}
if(cnt[v] == n - 1) {cur --; return 1;}
if(cur > rem){
cur --; return 1;
}
return 0;
}