제출 #959819

#제출 시각아이디문제언어결과실행 시간메모리
959819marinaluca게임 (IOI14_game)C++14
100 / 100
238 ms18292 KiB
#include "game.h" #include <bits/stdc++.h> /**#pragma GCC optimize ("O4") #pragma GCC optimize ("fast-math") #pragma GCC optimize ("unroll-loops") **/ #define XX first #define YY second #define all(x) begin(x), end (x) #define FOR(i, a, b) for(int i = (a); i <= (b); i++) #define FORD(i, b, a) for(int i = (b); i >= (a); i--) #define REP(i, a, b) for (int i = (a); i < (b); i++) #define left Left #define right Right using namespace std; typedef long long ll; typedef unsigned long long ull; typedef double dbl; typedef long double ldbl; template <class A, class B> bool maxim (A& x, B& y){ if (x < y) return x = y, true; else return false; } template <class A, class B> bool minim (A& x, B& y){ if (x > y) return x = y, true; else return false; } /*END OF TEMPLATE XD*/ const int NMAX = 1506; int city[NMAX + 1]; int distance[NMAX + 1]; int n; void initialize (int m){ n = m; REP (i, 0, n) city[i] = false; } int hasEdge (int u, int v){ return (++ city[u > v ? u : v]) == (u > v ? u : v); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...