Submission #584141

#TimeUsernameProblemLanguageResultExecution timeMemory
584141CauchicoMemory (IOI10_memory)C++14
100 / 100
2 ms272 KiB
#include <bits/stdc++.h> #include "grader.h" #include "memory.h" using namespace std; typedef long long ll; void play() { vector<bool> found(25); vector<pair<int,int>> a(25,{-1,-1}); for (int i=1;i<=25;i++) { char x = faceup(i); char y = faceup(i+25); if (x==y) { found[x-'A'] = true; } if (a[x-'A'].first == -1) { a[x-'A'].first = i; } else { a[x-'A'].second = i; } if (a[y-'A'].first == -1) { a[y-'A'].first = i+25; } else { a[y-'A'].second = i+25; } } for (int i=0;i<25;i++) { if (not found[i]) { faceup(a[i].first); faceup(a[i].second); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...