oj.uz

Submission #39021

# Submission time Handle Problem Language Result Execution time Memory
39021 2018-01-09T05:33:41 Z Scayre Marriage questions (IZhO14_marriage) C++14
2 / 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

	cin >> n >> m >> k;

  	cout << (n+m)/2 << endl;

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

	ioi
}

Subtask #1
2.0 / 100.0

# Verdict Execution time Memory 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 Correct 0 ms 6080 KB Output is 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
21 Incorrect 0 ms 6080 KB Output isn't correct
22 Incorrect 0 ms 6080 KB Output isn't correct
23 Incorrect 0 ms 6080 KB Output isn't correct
24 Incorrect 0 ms 6080 KB Output isn't correct
25 Incorrect 0 ms 6080 KB Output isn't correct
26 Incorrect 0 ms 6080 KB Output isn't correct
27 Incorrect 0 ms 6080 KB Output isn't correct
28 Incorrect 0 ms 6080 KB Output isn't correct
29 Incorrect 0 ms 6080 KB Output isn't correct
30 Incorrect 0 ms 6080 KB Output isn't correct
31 Incorrect 0 ms 6080 KB Output isn't correct
32 Incorrect 0 ms 6080 KB Output isn't correct
33 Incorrect 0 ms 6080 KB Output isn't correct
34 Incorrect 0 ms 6080 KB Output isn't correct
35 Incorrect 0 ms 6080 KB Output isn't correct
36 Incorrect 0 ms 6080 KB Output isn't correct
37 Incorrect 0 ms 6080 KB Output isn't correct
38 Incorrect 0 ms 6080 KB Output isn't correct
39 Incorrect 0 ms 6080 KB Output isn't correct
40 Incorrect 0 ms 6080 KB Output isn't correct
41 Incorrect 0 ms 6080 KB Output isn't correct
42 Incorrect 0 ms 6080 KB Output isn't correct
43 Incorrect 0 ms 6080 KB Output isn't correct
44 Incorrect 0 ms 6080 KB Output isn't correct
45 Incorrect 0 ms 6080 KB Output isn't correct
46 Incorrect 0 ms 6080 KB Output isn't correct
47 Incorrect 0 ms 6080 KB Output isn't correct
48 Incorrect 0 ms 6080 KB Output isn't correct
49 Incorrect 0 ms 6080 KB Output isn't correct
50 Incorrect 0 ms 6080 KB Output isn't correct