제출 #974901

#제출 시각아이디문제언어결과실행 시간메모리
974901rahidilbayramliMemory (IOI10_memory)C++17
0 / 100
1 ms344 KiB
#include "grader.h" #include "memory.h" #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define ll long long #define ld long double #define vl vector<ll> #define vi vector<int> #define pii pair<int, int> #define pll pair<ll, ll> #define all(v) v.begin(), v.end() #define pb push_back #define f first #define s second using namespace std; using namespace __gnu_pbds; typedef tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; void play() { map<char, pll>mp; for(char c = 'A'; c <= 'Z'; c++) mp[c] = {-1, -1}; for(int i = 1; i <= 50; i++) { char a = faceup(i); if(mp[a].f == -1) mp[a].f = i; else mp[a].s = i; } for(auto u : mp) { ll x = u.s.f, y = u.s.s; faceup(x); faceup(y); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...