| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1170377 | bbartek | Minerals (JOI19_minerals) | C++20 | 0 ms | 0 KiB | 
#include <bits/stdc++.h>
#include "minerals.h"
using namespace std;
typedef long long ll;
#define st first
#define nd second
#define pb push_back
const int maxn = 1e5+7;
/*
int para[] = {0,1,3,3,1,2,4,4,2};
set<int> zbior;
int Query(int x){
    if(zbior.count(x)){
        zbior.erase(x);
    }
    else{
        zbior.insert(x);
    }
    set<int> aktualny;
    for(auto i : zbior){
        aktualny.insert(para[(i)]);
    }
    return aktualny.size();
}
void Answer(int a, int b) {
    //cout<<a<<" "<<b<<"\n";
}
*/
bool zaznaczone[maxn];
vector<pair<int,int>> wyniki;
void rek(vector<int> num1,vector<int> num2,bool parzystosc){
    if(num1.size() == 1){
        wyniki.pb({num1[0],num1[1]});
        return;
    }
    vector<int> x1,x2,y1,y2;
    int dlu = num1.size(),nowy,stary;
    if(parzystosc == 0){
        for(int i=0;i<dlu/2;i++){
            stary = Query(num1[i]);
            x1.pb(num1[i]);
        }
        for(int i=dlu/2;i<dlu;i++){
            y1.pb(num1[i]);
        }
    }
    else{
        for(int i=0;i<dlu/2;i++){
            x1.pb(num1[i]);
        }
        for(int i=dlu/2;i<dlu;i++){
            stary = Query(num1[i]);
            y1.pb(num1[i]);
        }
    }
    for(int i=0;i<dlu;i++){
        nowy = Query(num2[i]);
        if(nowy == stary){
            x2.pb(num2[i]);
        }
        else{
            y2.pb(num2[i]);
        }
        stary = nowy;
    }
    rek(x1,x2,0);
    rek(y1,y2,1);
    return;
}
void Solve(int n) {   //Query(x) // Answer(a,b)
    vector<int> vect1,vect2;
    int a=0,b;
    for(int i=1;i<=2*n;i++){
        b = Query(i);
        if(b != a)
            vect.pb(i);
        else
            vect2.pb(i);
        a = b;
    }
    rek(vect1,vect2,0);
    for(auto i : wyniki){
        Answer(i.st,i.nd);
    }
}
/*
int main(){
    Solve(4);
    return 0;
}
*/
