Submission #1041745

#TimeUsernameProblemLanguageResultExecution timeMemory
1041745kheiraMemory (IOI10_memory)C++14
100 / 100
2 ms600 KiB
#include "grader.h" #include "memory.h" #include <map> #include <vector> using namespace std; void play() { map<char, vector<int>> Cards; vector<pair<int, int>> matchedCards; for (int C = 1; C <= 50; ++C) { char letterCard = faceup(C); if (Cards.find(letterCard) != Cards.end()) { int previousCard = Cards[letterCard][0]; matchedCards.push_back(make_pair(previousCard, C)); faceup(previousCard); faceup(C); } else { Cards[letterCard].push_back(C); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...