# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
376644 | Gajowy | 늑대인간 (IOI18_werewolf) | C++14 | 1279 ms | 137480 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/*
Antoni Dlugosz
VLO Krakow
"You know google - they ask you interview questions, well, the kind of question i face on the job is:
"is this bad, is this too much voodoo for our purposes for our mission statement?".
Our mission is to be a modern Commodore64, is this too much voodoo that, this is the op-, this,
there is, this is voodoo, the question is "is this too much?" and that's, this is the hardest question
you could ever face in programming. This right here is the hardest question, right here, right here is the
hardest question in programming, "is this too much voodoo for the next ten centuries?", as f-, for god's officlal temple,
Holy, Holy C is the hardest question in programming, right here, okay, there it is, the hardest question in programming."
~ the late Terry A. Davis
*/
//fast stuff
//#pragma GCC optimize("Ofast")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define e1 first
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |