Submission #726590

#	Time	Username	Problem	Language	Result	Execution time	Memory
726590		horiseun	Memory (IOI10_memory)	C++11	100 / 100	3 ms	236 KiB

memory

#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include "memory.h"
#include "grader.h"
using namespace std;

#define ll long long
#define f first
#define s second

int pos[25][2];

void play() {
   fill(&pos[0][0], &pos[0][0] + sizeof(pos) / sizeof(pos[0][0]), -1);
   for (int i = 1; i <= 50; i++) {
      int v = faceup(i) - 'A';
      if (pos[v][0] == -1) pos[v][0] = i;
      else pos[v][1] = i;
   }
   for (int i = 0; i < 25; i++) {
      faceup(pos[i][0]);
      faceup(pos[i][1]);
   }
   return;
}

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