# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466364 | Namnamseo | Memory 2 (JOI16_memory2) | C++17 | 1 ms | 332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Memory2_lib.h"
#include <vector>
#include <set>
#include <map>
using namespace std;
bool chk[100][100];
int ret[100][100];
int flip(int a,int b){
if(a>b) swap(a, b);
int& ret=::ret[a][b];
if(chk[a][b]) return ret;
chk[a][b]=1;
return ret = Flip(a, b);
}
void Solve(int T, int n){
set<int> mxpt;
mxpt.insert(0);
mxpt.insert(1);
vector<vector<int>> ans(n);
for(int i=2; i<2*n; ++i){
mxpt.insert(i);
vector<int> pts(mxpt.begin(), mxpt.end());
int k=pts.size();
set<int> vars[k];
set<int> szs;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |