제출 #39647

#제출 시각아이디문제언어결과실행 시간메모리
39647deletend게임 (IOI14_game)C++14
0 / 100
6 ms19804 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> P; typedef pair<ll, ll> LP; #define pb push_back #define rep(i, a, n) for(int i = (a); i < (n); i++) #define mod (ll)(1e9+7) __attribute__((constructor)) void initial() { cin.tie(0); ios::sync_with_stdio(false); } int s[1501], gn, c; int sd[1501][1501]; int hasEdge(int u, int v) { if(u > v) swap(u, v); if(sd[u][v] != -1) return sd[u][v]; s[u]++; c++; if(c == ((gn + 2) * (gn + 1)) / 2) return sd[u][v] = true; if(c == (((gn + 2) * (gn + 1)) / 2) - 1) return sd[u][v] = false; if(s[u] == gn - u) return sd[u][v] = true; else return sd[u][v] = false; } void initialize(int n) { gn = n - 2; c = 0; rep(i, 0, 1501) s[i] = 0; rep(i, 0, 1501) rep(j, 0, 1501) { sd[i][j] = -1; } } // int main() { // int n = 4; // initialize(n); // rep(i, 0, n * (n - 1) / 2) { // int a, b; // cin >> a >> b; // cout << hasEdge(a, b) << endl; // } // // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...