oj.uz

Submission #390390

# Submission time Handle Problem Language Result Execution time Memory
390390 2021-04-16T00:58:57 Z arwaeystoamneg Memory (IOI10_memory) C++17
100 / 100
 3 ms 328 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 != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}
#include "grader.h"
#include "memory.h"
#ifdef arwaeystoamneg
static char card[51];
static int up[2], is_up[51], candy[25], candies, moves;

char faceup(int C) {
	int c0, c1;
	if (C < 1 || C > 50 || is_up[C]) {
		exit(92);
	}
	is_up[C] = 1;
	up[moves % 2] = C;
	moves++;
	if (moves % 2 == 0) {
		c0 = card[up[0]] - 'A';
		c1 = card[up[1]] - 'A';
		if (c0 == c1 && !candy[c0]) {
			candy[c0] = 1;
			++candies;
		}
		is_up[up[0]] = is_up[up[1]] = 0;
	}
	return card[C];
}

#endif
void play() {
	int a[25][2], c[25];
	F0R(i, 25)a[i][0] = a[i][1] = c[i] = 0;
	F0R(i, 50)
	{
		char x;
		x = faceup(i + 1);
		a[x - 'A'][c[x - 'A']++] = i;
	}
	F0R(i, 25)
	{
		faceup(a[i][0] + 1);
		faceup(a[i][1] + 1);
	}
}


#ifdef arwaeystoamneg
void playgame() {
	int i;
	for (i = 1; i <= 50; i++) {
		card[i] = getchar();
	}
	moves = candies = 0;
	play();
	if (candies != 25) {
		exit(91);
	}
}
int main() 
{
	setIO("test1");
	playgame();
	printf("OK %d\n", moves);
	return 0;
}

#endif

Compilation message

memory.cpp: In function 'void setIO(std::string)':
memory.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);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
memory.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
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 200 KB Output is correct
2 Correct 2 ms 200 KB Output is correct
3 Correct 2 ms 200 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 2 ms 200 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 2 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 2 ms 200 KB Output is correct
21 Correct 2 ms 200 KB Output is correct
22 Correct 2 ms 200 KB Output is correct
23 Correct 2 ms 200 KB Output is correct
24 Correct 2 ms 200 KB Output is correct
25 Correct 2 ms 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 2 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 3 ms 200 KB Output is correct
33 Correct 2 ms 200 KB Output is correct
34 Correct 3 ms 200 KB Output is correct
35 Correct 2 ms 204 KB Output is correct
36 Correct 2 ms 200 KB Output is correct
37 Correct 1 ms 200 KB Output is correct
38 Correct 2 ms 204 KB Output is correct
39 Correct 2 ms 200 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 2 ms 200 KB Output is correct
42 Correct 2 ms 200 KB Output is correct
43 Correct 2 ms 200 KB Output is correct
44 Correct 2 ms 200 KB Output is correct
45 Correct 1 ms 200 KB Output is correct
46 Correct 1 ms 200 KB Output is correct
47 Correct 2 ms 200 KB Output is correct
48 Correct 2 ms 200 KB Output is correct
49 Correct 2 ms 204 KB Output is correct
50 Correct 2 ms 200 KB Output is correct
51 Correct 2 ms 200 KB Output is correct
52 Correct 2 ms 200 KB Output is correct
53 Correct 2 ms 200 KB Output is correct
54 Correct 2 ms 200 KB Output is correct
55 Correct 2 ms 200 KB Output is correct
56 Correct 2 ms 200 KB Output is correct
57 Correct 1 ms 200 KB Output is correct
58 Correct 2 ms 200 KB Output is correct
59 Correct 2 ms 200 KB Output is correct
60 Correct 2 ms 200 KB Output is correct
61 Correct 2 ms 200 KB Output is correct
62 Correct 2 ms 200 KB Output is correct
63 Correct 2 ms 200 KB Output is correct
64 Correct 2 ms 200 KB Output is correct
65 Correct 1 ms 200 KB Output is correct
66 Correct 1 ms 200 KB Output is correct
67 Correct 1 ms 200 KB Output is correct
68 Correct 1 ms 200 KB Output is correct
69 Correct 2 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 2 ms 200 KB Output is correct
72 Correct 2 ms 200 KB Output is correct
73 Correct 1 ms 200 KB Output is correct
74 Correct 2 ms 200 KB Output is correct
75 Correct 2 ms 200 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 2 ms 200 KB Output is correct
79 Correct 2 ms 200 KB Output is correct
80 Correct 2 ms 200 KB Output is correct
81 Correct 2 ms 288 KB Output is correct
82 Correct 1 ms 200 KB Output is correct
83 Correct 2 ms 200 KB Output is correct
84 Correct 2 ms 200 KB Output is correct
85 Correct 2 ms 200 KB Output is correct
86 Correct 2 ms 200 KB Output is correct
87 Correct 1 ms 200 KB Output is correct
88 Correct 1 ms 200 KB Output is correct
89 Correct 2 ms 200 KB Output is correct
90 Correct 2 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct
92 Correct 1 ms 292 KB Output is correct
93 Correct 2 ms 200 KB Output is correct
94 Correct 1 ms 292 KB Output is correct
95 Correct 1 ms 200 KB Output is correct
96 Correct 1 ms 328 KB Output is correct
97 Correct 1 ms 200 KB Output is correct
98 Correct 2 ms 200 KB Output is correct
99 Correct 2 ms 200 KB Output is correct
100 Correct 1 ms 272 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 288 KB Output is correct
2 Correct 3 ms 268 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 3 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 3 ms 200 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 2 ms 204 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 1 ms 200 KB Output is correct
17 Correct 2 ms 200 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 2 ms 200 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 2 ms 200 KB Output is correct
23 Correct 2 ms 200 KB Output is correct
24 Correct 2 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 2 ms 200 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 2 ms 200 KB Output is correct
30 Correct 2 ms 200 KB Output is correct
31 Correct 2 ms 200 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 2 ms 200 KB Output is correct
34 Correct 1 ms 284 KB Output is correct
35 Correct 1 ms 200 KB Output is correct
36 Correct 2 ms 200 KB Output is correct
37 Correct 1 ms 200 KB Output is correct
38 Correct 1 ms 200 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 3 ms 200 KB Output is correct
41 Correct 1 ms 200 KB Output is correct
42 Correct 1 ms 200 KB Output is correct
43 Correct 2 ms 204 KB Output is correct
44 Correct 2 ms 200 KB Output is correct
45 Correct 2 ms 200 KB Output is correct
46 Correct 1 ms 200 KB Output is correct
47 Correct 2 ms 200 KB Output is correct
48 Correct 2 ms 200 KB Output is correct
49 Correct 1 ms 200 KB Output is correct
50 Correct 1 ms 200 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 200 KB Output is correct
53 Correct 2 ms 200 KB Output is correct
54 Correct 2 ms 200 KB Output is correct
55 Correct 1 ms 200 KB Output is correct
56 Correct 2 ms 200 KB Output is correct
57 Correct 2 ms 200 KB Output is correct
58 Correct 1 ms 200 KB Output is correct
59 Correct 2 ms 200 KB Output is correct
60 Correct 2 ms 200 KB Output is correct
61 Correct 2 ms 200 KB Output is correct
62 Correct 2 ms 200 KB Output is correct
63 Correct 2 ms 200 KB Output is correct
64 Correct 2 ms 200 KB Output is correct
65 Correct 2 ms 200 KB Output is correct
66 Correct 2 ms 200 KB Output is correct
67 Correct 2 ms 200 KB Output is correct
68 Correct 2 ms 200 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 2 ms 200 KB Output is correct
72 Correct 2 ms 200 KB Output is correct
73 Correct 1 ms 200 KB Output is correct
74 Correct 2 ms 200 KB Output is correct
75 Correct 1 ms 200 KB Output is correct
76 Correct 2 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 2 ms 200 KB Output is correct
79 Correct 2 ms 200 KB Output is correct
80 Correct 1 ms 200 KB Output is correct
81 Correct 2 ms 200 KB Output is correct
82 Correct 1 ms 200 KB Output is correct
83 Correct 2 ms 200 KB Output is correct
84 Correct 2 ms 200 KB Output is correct
85 Correct 1 ms 200 KB Output is correct
86 Correct 1 ms 200 KB Output is correct
87 Correct 2 ms 200 KB Output is correct
88 Correct 2 ms 200 KB Output is correct
89 Correct 2 ms 200 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 2 ms 200 KB Output is correct
92 Correct 2 ms 200 KB Output is correct
93 Correct 2 ms 200 KB Output is correct
94 Correct 2 ms 328 KB Output is correct
95 Correct 2 ms 200 KB Output is correct
96 Correct 2 ms 200 KB Output is correct
97 Correct 2 ms 200 KB Output is correct
98 Correct 2 ms 200 KB Output is correct
99 Correct 1 ms 200 KB Output is correct
100 Correct 1 ms 200 KB Output is correct