제출 #1219388

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1219388		inesfi	Mechanical Doll (IOI18_doll)	C++20	16 / 100	47 ms	14500 KiB

doll

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

const int TAILLEMAXI=100*1000+2;
vector<int> vers[TAILLEMAXI];
vector<int> X,Y,prochain;

void create_circuit(int M,vector<int> A) {
    A.push_back(0);
    for (int i=0;i<(int)A.size()-1;i++){
        vers[A[i]].push_back(A[i+1]);
    }
    int compt=-1;
    prochain.push_back(A[0]);
    for (int i=1;i<=M;i++){
        if (vers[i].size()==0){
            prochain.push_back(0);
        }
        else if (vers[i].size()==1){
            prochain.push_back(vers[i][0]);
        }
        else if (vers[i].size()==2){
            prochain.push_back(compt);
            compt--;
            X.push_back(vers[i][0]);
            Y.push_back(vers[i][1]);
        }
        else if (vers[i].size()==3){
            prochain.push_back(compt);
            compt--;
            X.push_back(compt);
            compt--;
            Y.push_back(compt);
            X.push_back(vers[i][0]);
            Y.push_back(compt+2);
            X.push_back(vers[i][1]);
            Y.push_back(vers[i][2]);
            compt--;
        }
        else if (vers[i].size()==4){
            prochain.push_back(compt);
            compt--;
            X.push_back(compt);
            compt--;
            Y.push_back(compt);
            X.push_back(vers[i][0]);
            Y.push_back(vers[i][2]);
            X.push_back(vers[i][1]);
            Y.push_back(vers[i][3]);
            compt--;
        }
    }
    /*for (auto a:prochain){
        cout<<a<<" ";
    }
    cout<<endl;
    for (auto a:X){
        cout<<a<<" ";
    }
    cout<<endl;
    for (auto a:Y){
        cout<<a<<" ";
    }
    cout<<endl;*/
    answer(prochain,X,Y);
}

• Subtask 1: 2 / 2
• Subtask 2: 4 / 4
• Subtask 3: 10 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 18
• Subtask 6: 0 / 56