제출 #312077

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312077		kylych03	자동 인형 (IOI18_doll)	C++14	63 / 100	210 ms	20812 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);
        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()%2==1){
        v.insert(v.begin()  , -cnt);
    }
    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();
     if(N==16){
        vector<vector<int> > qs(M + 1);
        for(int i = 0; i < N; ++i) {
            qs[A[i]].push_back(i);
        }
         int bits = 1;
        while((1 << bits) < N) ++bits;
        vector<int> C(M + 1, -1);
        C[0] = A[0];
        vector<int> X((1 << bits) - 1, -1), Y((1 << bits) - 1, -1);
        for(int i = 1; i < 1 << (bits - 1); ++i) {
            X[i - 1] = -(2 * i);
            Y[i - 1] = -(2 * i + 1);
        }
        vector<int> perm;
        for(int i = 1 << bits; i < 2 << bits; ++i) {
            perm.push_back(i);
        }
        sort(perm.begin(), perm.end(), [&](int i, int j) {
            for(int k = 0; k < bits; ++k) {
                if(((i >> k) & 1) != ((j >> k) & 1)) {
                    return ((i >> k) & 1) < ((j >> k) & 1);
                }
            }
            return false;
        });
        for(int i = 0; i < 1 << bits; ++i) {
            int tar = i - ((1 << bits) - N);
            if(tar < 0) tar = -1;
            else if(i != ((1 << bits) - 1)) tar = A[tar + 1];
            else tar = 0;
            if(perm[i] % 2 == 0) {
                X[perm[i] / 2 - 1] = tar;
            }
            else {
                Y[perm[i] / 2 - 1] = tar;
            }
        }
        answer(C, X, Y);
        return ;
	}
    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:29:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int i = 0; i < v.size(); i++){
      |                    ~~^~~~~~~~~~

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