제출 #1237778

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237778		inesfi	스핑크스 (IOI24_sphinx)	C++20	10 / 100	8 ms	904 KiB

sphinx

#include "sphinx.h"
#include<bits/stdc++.h>
using namespace std;

// int x = perform_experiment(E);

const int TAILLEMAXI=52;
int voisin[TAILLEMAXI];

vector<int> find_colours(int n,vector<int> deb,vector<int> fin) {
    for (int i=0;i<(int)deb.size();i++){
        voisin[deb[i]]=fin[i];
        voisin[fin[i]]=deb[i];
    }
    vector<int> quest={};
    vector<int> rep={};
    for (int i=0;i<n;i++){
        quest.push_back(n);
        //cout<<voisin[i]<<endl;
    }
    for (int i=0;i<n;i++){
        bool ok=false;
        int numcouleur=0;
        vector<int> q=quest;
        q[i]=n-1;
        q[voisin[i]]=n-1;
        int nbcompo=perform_experiment(q);
        while (ok==false){
            vector<int> ec=quest;
            ec[i]=-1;
            ec[voisin[i]]=numcouleur;
            if (perform_experiment(ec)==nbcompo){
                rep.push_back(numcouleur);
                ok=true;
            }
            numcouleur++;
        }
    }
    return rep;
}

• Subtask 0: 0 / 0
• Subtask 1: 3 / 3
• Subtask 2: 7 / 7
• Subtask 3: 0 / 33
• Subtask 4: 0 / 21
• Subtask 5: 0 / 36