Submission #1041739

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041739		kheira	Memory (IOI10_memory)	C++14	100 / 100	1 ms	600 KiB

memory

#include "grader.h"
#include "memory.h"
#include <unordered_map>
#include <vector>
#include <utility>

using namespace std;

void play() {
    unordered_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);
        }
    }
}

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