| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1165975 | RED1 | Treasure (IOI24_treasure) | C++17 | 0 ms | 840 KiB | 
#include <bits/stdc++.h>
#include "treasure.h"
using namespace std;
typedef long long ll;
map<int,vector<pair<int, int>>> mp;
int id = 0;
vector<pair<int, int>> decode(vector<int> S){
    return mp[S.back()];
}
vector<int> encode(vector<pair<int, int>> P){
    ++id;
    mp[id] = P;
    vector<int> a;
    a.push_back(id);
    return a;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
