oj.uz

Submission #392389

# Submission time Handle Problem Language Result Execution time Memory
392389 2021-04-21T01:57:25 Z arwaeystoamneg Game (IOI14_game) C++17
100 / 100
 372 ms 16232 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test2")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}
#ifndef arwaeystoamneg
#include "game.h";
#endif
int n;
const int MAX = 1505;
int a[MAX];
void initialize(int n_)
{
	n = n_;
}
int hasEdge(int x, int y)
{
	if (x < y)swap(x, y);
	a[x]++;
	if (a[x] == x)return 1;
	return 0;
}
#ifdef arwaeystoamneg
int main()
{
	setIO("");
	int n;
	cin >> n;
	int t = n * (n - 1) / 2;
	initialize(n);
	vpi ans;
	while (t--)
	{
		int x, y;
		cin >> x >> y;
		int t = hasEdge(x, y);
		cout << (t ? "YES" : "NO") << endl;
		if (t)ans.pb({ x,y });
	}
	trav(x, ans)cout << x.f << " " << x.s << endl;
}


#endif

Compilation message

game.cpp:54:18: warning: extra tokens at end of #include directive
   54 | #include "game.h";
      |                  ^
game.cpp: In function 'void setIO(std::string)':
game.cpp:48:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
game.cpp:50:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 2 ms 204 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 276 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 2 ms 312 KB Output is correct
36 Correct 2 ms 312 KB Output is correct
37 Correct 2 ms 332 KB Output is correct
38 Correct 2 ms 336 KB Output is correct
39 Correct 2 ms 204 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Correct 2 ms 312 KB Output is correct
42 Correct 2 ms 332 KB Output is correct
43 Correct 2 ms 320 KB Output is correct
44 Correct 2 ms 332 KB Output is correct
45 Correct 2 ms 332 KB Output is correct
46 Correct 2 ms 332 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 2 ms 336 KB Output is correct
49 Correct 2 ms 312 KB Output is correct
50 Correct 2 ms 332 KB Output is correct
51 Correct 2 ms 312 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 2 ms 332 KB Output is correct
54 Correct 2 ms 332 KB Output is correct

Subtask #3
58.0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 2 ms 312 KB Output is correct
37 Correct 2 ms 344 KB Output is correct
38 Correct 2 ms 332 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Correct 2 ms 332 KB Output is correct
42 Correct 2 ms 332 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 2 ms 332 KB Output is correct
45 Correct 2 ms 332 KB Output is correct
46 Correct 2 ms 332 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 2 ms 332 KB Output is correct
49 Correct 2 ms 332 KB Output is correct
50 Correct 2 ms 332 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 2 ms 312 KB Output is correct
53 Correct 2 ms 332 KB Output is correct
54 Correct 2 ms 336 KB Output is correct
55 Correct 41 ms 1936 KB Output is correct
56 Correct 41 ms 2016 KB Output is correct
57 Correct 42 ms 2012 KB Output is correct
58 Correct 53 ms 2044 KB Output is correct
59 Correct 41 ms 2028 KB Output is correct
60 Correct 41 ms 1924 KB Output is correct
61 Correct 41 ms 1996 KB Output is correct
62 Correct 41 ms 1924 KB Output is correct
63 Correct 42 ms 2028 KB Output is correct
64 Correct 41 ms 1932 KB Output is correct
65 Correct 41 ms 1948 KB Output is correct
66 Correct 41 ms 1944 KB Output is correct
67 Correct 41 ms 2028 KB Output is correct
68 Correct 42 ms 1992 KB Output is correct
69 Correct 41 ms 1996 KB Output is correct
70 Correct 41 ms 1980 KB Output is correct
71 Correct 41 ms 2008 KB Output is correct
72 Correct 43 ms 2068 KB Output is correct
73 Correct 42 ms 2040 KB Output is correct
74 Correct 41 ms 1952 KB Output is correct
75 Correct 41 ms 1988 KB Output is correct
76 Correct 95 ms 4272 KB Output is correct
77 Correct 94 ms 4292 KB Output is correct
78 Correct 93 ms 4292 KB Output is correct
79 Correct 100 ms 4420 KB Output is correct
80 Correct 93 ms 4244 KB Output is correct
81 Correct 94 ms 4336 KB Output is correct
82 Correct 93 ms 4296 KB Output is correct
83 Correct 93 ms 4260 KB Output is correct
84 Correct 93 ms 4328 KB Output is correct
85 Correct 169 ms 7364 KB Output is correct
86 Correct 163 ms 7308 KB Output is correct
87 Correct 163 ms 7364 KB Output is correct
88 Correct 162 ms 7344 KB Output is correct
89 Correct 160 ms 7364 KB Output is correct
90 Correct 163 ms 7376 KB Output is correct
91 Correct 161 ms 7284 KB Output is correct
92 Correct 166 ms 7324 KB Output is correct
93 Correct 168 ms 7368 KB Output is correct
94 Correct 372 ms 16220 KB Output is correct
95 Correct 362 ms 16196 KB Output is correct
96 Correct 367 ms 16200 KB Output is correct
97 Correct 363 ms 16196 KB Output is correct
98 Correct 366 ms 16196 KB Output is correct
99 Correct 370 ms 16232 KB Output is correct
100 Correct 364 ms 16196 KB Output is correct