제출 #412439

#제출 시각아이디문제언어결과실행 시간메모리
412439abdzagMemory (IOI10_memory)C++17
0 / 100
2 ms456 KiB
#include<bits/stdc++.h> #include<unordered_map> #include"grader.h" #define rep(i,a,b) for(int i=int(a);i<int(b);i++) #define rrep(i,a,b) for(int i=int(a);i>int(b);i--) #define all(v) v.begin(),v.end() #define trav(a,v) for(auto&a:v) #define sz(a) a.size() typedef long double ld; using namespace std; static const long long inf = 1e15; typedef long long ll; typedef unsigned long long ull; void play(){ vector<char> v(50); rep(i, 0, 50)v[i] = faceup(i+1); rep(i, 0, 50) { rep(j, 0, 50) { if (j == i)continue; if (v[i] == v[j]) { faceup(i+1); faceup(j+1); v.erase(v.begin() + j); break; } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...