제출 #312066

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

doll

#include "doll.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
int vis[200002];
vector <int> x,y;
vector <int> vec[200002];
int cnt = 1;
void rec(vector <int > v){
    vector <int> v1, v2;
    if(v.size()==0)
        return ;
    if(v.size()==1){
        x.push_back(-cnt-1);
        y.push_back(-cnt-1);
        cnt++;
        x.push_back(-cnt+1);
        y.push_back(v[0]);
        cnt++;
        return ;
    }
    if(v.size()==2){
        x.push_back(v[0]);
        y.push_back(v[1]);
        cnt++;
        return ;
    }
    if(v.size()==3){

        x.push_back(-cnt-1);
        y.push_back(-cnt-2);
        cnt++;
        x.push_back(-cnt+1);
        y.push_back(v[1]);
        cnt++;
        x.push_back(v[0]);
        y.push_back(v[2]);
        cnt++;


        return ;
    }

    for(int i = 0; i < v.size(); i++){
        if(i%2==0 )
            v1.push_back(v[i]);
        else
            v2.push_back(v[i]);
    }
    int p = cnt;
    cnt++;
    x.push_back(-cnt);
    y.push_back(-cnt);

    rec(v1);
    y[p-1]=-cnt;
    rec(v2);

}
void create_circuit(int M, std::vector<int> A) {
  int N = A.size();

    std::vector<int> C(M + 1);
    vector <int> X, Y;
    for(int i = 0; i<M+1; i++){
        C[i]=0;
    }
    C[0]=A[0];
    A.push_back(0);
    for(int i = 0 ; i < N; i++){
        vec[A[i]].push_back(A[i+1]);
    }
    for(int i = 1 ; i <=M ;i++){
        if(vec[i].size()>0){
            C[i] = -cnt;
            rec( vec[i]);
        }

    }
    /*for(int i = 0; i <C.size(); i++)
        cout << C[i]<<" ";
    cout << endl;
    for(int i = 0; i <x.size(); i++)
        cout << x[i]<<" "<<y[i]<<endl;
    cout << endl;
*/

  answer(C, x, y);
}

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

doll.cpp: In function 'void rec(std::vector<int>)':
doll.cpp:44:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i = 0; i < v.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