| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1006421 | kebine | 게임 (IOI14_game) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
/* Pragmaaa */
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
/* Primitive Data */
#define ll long long
#define db double
/* Pair Macro */
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define sc second
/* Vector Macro */
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
/* All Rounder */
#define all(x) x.begin(),x.end()
#define forn(i,n) for(int (i) = 1; i<= int (n); i++)
#define for0(i,n) for(int (i) = 0; i < int (n); i++)
#define INF 1e9
#define LLINF 1e18
#define nl '\n'
#define tab ' '
// Hati-hati kalau mau ngeflush tapi endl jadi nya '\n'
#define flushmanual ios_base::sync_with_stdio(false); cin.tie(NULL)
/* Modulo Fuctions */
const ll MOD = 1e9+7;
ll tambah(ll a, ll b){
return (a+b)%MOD;
}
ll kurang(ll a, ll b){
return (((a - b) % MOD) + MOD) % MOD;
}
ll mul(ll a, ll b){
return ((a%MOD) * (b%MOD))%MOD;
}
/* debuggin */
#define debugl cout<<"Here\n"
#define debug(awok) cout<<(awok)<<endl
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH (TRY DP INSTEAD OF GREEDY AND VICE VERSA)(DONT FORGET SORTING)
* TRY ALL STRATEGIES
* DO NOT READ EDITORIALS BEFORE TRYING REALLY HARD!
* careful references in recursion
* careful copying when doing vectors esp in loops and functions
* careful long long int and mod always OMG
* careful return types of std such as int(ceil)
* WATCH OUT GOING OVER MAX thru operations spam mod
* vectors overflow arrays do NOT
* cout endl lol
* lower bound is first greater or equal
* upper is first greater
* if TLE play around with compiler
* use static is helpful!!
* take note of test stuff that need to be changed before submission
* careful when u use garbage from abroad
* careful modeling stuff as num going below 0 above n
* number theory infinite due to multple of each other
* careful not finding stuff in dictionaries
* stupid cout precision and sci notations
* in sets, rbegin() or --end() for last
* careful multiset removal just use heapp
* no segment trees if partial mins are needed, use sparse table
* in combinatorics log matters esp in that dp, and think v carefully
* NEVER INPUT DOUBLES
* fraction class or multiplication tricks?
* omg dont forget to flush when debugging
* watch out for bitwise operations order of operations
* PQ Greater top is smallest and Less top is largest
*/
using namespace std;
ll que[2000];
void hasEdge(ll u,ll v){
if(que[u] == 1 || que[v] == 1){
cout << "yes" <<endl;
}else{
cout << "no" << endl;
}
}
void initialize(ll n){
for0(i,n)que[i] = n-1;
forn(i,(n*(n-1)/2)){
ll a,b;
cin >> a >> b;
hasEdge(a,b);
que[a]--;
que[b]--;
}
}