제출 #312114

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312114		amunduzbaev	자동 인형 (IOI18_doll)	C++14	0 / 100	2 ms	204 KiB

doll

//#include "grader.cpp"
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,m,ind=-1;
vector<int> x, y;
vector<vector<int>>way;
void create_circuit(int M, vector<int> a) {
    n=a.size();
    m=M;
    vector<int>c(m+1,0);
    way.resize(m+1);
    c[0]=a[0];
    for(int i=0;i<n-1;i++){
        way[a[i]].push_back(a[i+1]);
        c[a[i]]=a[i+1];
    }
    for(int i=1;i<=m;i++){
        int s=way[i].size();
        if(s<=1) continue;
        c[i]=ind--;
        if(s==2){
            x.push_back(way[i][0]);
            y.push_back(way[i][1]);
        }
        if(s==3){
            x.push_back(ind--);
            y.push_back(ind--);
            x.push_back(c[i]);
            y.push_back(way[i][1]);
            x.push_back(way[i][0]);
            y.push_back(way[i][2]);
        }
        if(s==4){
            x.push_back(ind--);
            y.push_back(ind--);
            x.push_back(way[i][0]);
            x.push_back(way[i][1]);
            y.push_back(way[i][2]);
            y.push_back(way[i][3]);
        }
    }

    for(int i=0;i<c.size();i++)
        cout<<c[i]<<" ";
    cout<<"\n";
    for(int i=0;i<x.size();i++)
        cout<<x[i]<<" "<<y[i]<<" \n";


    answer(c,x,y);

}

/*

9 9
2 9 8 1 3 7 6 4 5


4 4
1 2 1 3

6 6
1 2 1 3 1 4

*/

컴파일 시 표준 에러 (stderr) 메시지

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:45:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(int i=0;i<c.size();i++)
      |                 ~^~~~~~~~~
doll.cpp:48:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int i=0;i<x.size();i++)
      |                 ~^~~~~~~~~

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