제출 #466364

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
466364	2021-08-19 02:12:09	Namnamseo	Memory 2 (JOI16_memory2)	C++17	100 / 100	1 ms	332 KiB

memory2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 50 / 50
• Subtask 3: 40 / 40