Submission #648619

#	Time	Username	Problem	Language	Result	Execution time	Memory
648619		ghostwriter	Memory (IOI10_memory)	C++14	100 / 100	3 ms	336 KiB

memory

#include "grader.h"
#include "memory.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
char a[100];
vi pos[25];
void play() {
    FRN(i, 50) {
        a[i] = faceup(i + 1);
        a[i + 1] = faceup(i + 2);
        pos[a[i] - 'A'].pb(i);
        pos[a[i + 1] - 'A'].pb(i + 1);
        ++i;
    }
    FRN(i, 25) {
        faceup(pos[i].ft() + 1);
        faceup(pos[i].bk() + 1);
    }
}
/*
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Compilation message (stderr)

memory.cpp: In function 'void play()':
memory.cpp:37:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   37 | #define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
memory.cpp:57:5: note: in expansion of macro 'FRN'
   57 |     FRN(i, 50) {
      |     ^~~
memory.cpp:37:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   37 | #define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
memory.cpp:64:5: note: in expansion of macro 'FRN'
   64 |     FRN(i, 25) {
      |     ^~~

• Subtask 1: 50 / 50
• Subtask 2: 50 / 50