oj.uz

답안 #39022

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39022 2018-01-09T05:34:57 Z Scayre UFO (IZhO14_ufo) C++14
0 / 100
 0 ms 6080 KB 
//
// omae wa mou shindeiru.
//

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>

#define ll long long
#define ull unsigned ll
#define ioi exit(0);

#define f first
#define s second

#define inf (int)1e9 + 7

#define NFS ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define mp make_pair

#define lb(x) lower_bound(x)
#define ub(x) upper_bound(x)

#define pb push_back
#define ppb pop_back

#define endl "\n"

#define in(x) insert(x)

#define sz(x) (int)x.size()

#define all(x) x.begin(),x.end()

#define pw2(x) (1<<x) //2^x

#define sqr(x) ((x) * 1ll * (x))

using namespace std;

const int N = (int)1e6 + 7, MOD = (int)1e9 + 7;

int n,k,m;

int a[N];

ll ans;

set <int> s;

int main(){

	#ifdef IOI2019
		freopen ("in.txt", "r", stdin);
	#endif

	NFS

    cout << rand()%10 << endl;


	#ifdef IOI2019
		cout << "\nTime Elapsed : " << clock () * 1.0 / CLOCKS_PER_SEC << endl;
	#endif

	ioi
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 6080 KB Output isn't correct
2 Incorrect 0 ms 6080 KB Output isn't correct
3 Incorrect 0 ms 6080 KB Output isn't correct
4 Incorrect 0 ms 6080 KB Output isn't correct
5 Incorrect 0 ms 6080 KB Output isn't correct
6 Incorrect 0 ms 6080 KB Output isn't correct
7 Incorrect 0 ms 6080 KB Output isn't correct
8 Incorrect 0 ms 6080 KB Output isn't correct
9 Incorrect 0 ms 6080 KB Output isn't correct
10 Incorrect 0 ms 6080 KB Output isn't correct
11 Incorrect 0 ms 6080 KB Output isn't correct
12 Incorrect 0 ms 6080 KB Output isn't correct
13 Incorrect 0 ms 6080 KB Output isn't correct
14 Incorrect 0 ms 6080 KB Output isn't correct
15 Incorrect 0 ms 6080 KB Output isn't correct
16 Incorrect 0 ms 6080 KB Output isn't correct
17 Incorrect 0 ms 6080 KB Output isn't correct
18 Incorrect 0 ms 6080 KB Output isn't correct
19 Incorrect 0 ms 6080 KB Output isn't correct
20 Incorrect 0 ms 6080 KB Output isn't correct