Submission #923548

#	Time	Username	Problem	Language	Result	Execution time	Memory
923548		alexander707070	Chameleon's Love (JOI20_chameleon)	C++14	40 / 100	15 ms	476 KiB

chameleon

#include <bits/stdc++.h>
#include "chameleon.h"
#define MAXN 1007

using namespace std;

namespace {

int n,bad[MAXN];
vector<int> to[MAXN];
vector< pair<int,int> > sol;

}  // namespace

void Solve(int N) {
    n=N;
    for(int i=1;i<=2*n;i++){
        for(int f=i+1;f<=2*n;f++){
            if(Query({i,f})==1){
                to[i].push_back(f);
                to[f].push_back(i);
            }
        }
    }

    for(int i=1;i<=2*n;i++){
        if(to[i].size()==1)continue;
        else{
            if(Query({i,to[i][0],to[i][1]})==1)bad[i]=to[i][2];
            else if(Query({i,to[i][0],to[i][2]})==1)bad[i]=to[i][1];
            else if(Query({i,to[i][2],to[i][1]})==1)bad[i]=to[i][0];
        }
    }
    
    for(int i=1;i<=2*n;i++){
        for(int f:to[i]){
            if(bad[i]==f or bad[f]==i)continue;
            if(i<f)Answer(i,f);
        }
    }
}

• Subtask 1: 0 / 4
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36