제출 #311589

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

doll

//#include "grader.cpp"
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,m;
vector<int> ans, way[N], x, y, c(m+1,0);
int ind=1,in;
void solve(int l,int r,vector<int>v,char o){
    if(o=='l'){
        if(l!=r) x.push_back(-(ind+in));
        else {x.push_back(v[l]);
        return;}
    }else{
        if(l!=r) y.push_back(-(ind+in));
        else {y.push_back(v[l]);
        return;}
    }
    int m=(l+r)/2;
    o='l';
    in++;
    solve(l,m,v,o);
    o='r';
    in++;
    solve(m+1,r,v,o);
}
void fun(vector<int>v){
    in=1;
    int m=(v.size()-1)/2;
    solve(0,m,v,'l');
    in++;
    solve(m+1,v.size()-1,v,'r');
    ind=ind+in;
}
bool fnd(int i,int a){
    for(int j=0;j<way[i].size();j++)
        if(way[i][j]==a)
            return false;
    return true;
}
void create_circuit(int M, vector<int> a) {
    n=a.size();
    m=M;
    way[0].push_back(a[0]);
    c[0]=a[0];
    for(int i=0;i<n-1;i++){
        if(way[a[i]].size()&&fnd(a[i],a[i+1]))
            ans.push_back(a[i]);
        way[a[i]].push_back(a[i+1]);
        c[a[i]]=a[i+1];
    }

    for(int i=0;i<ans.size();i++){
        c[ans[i]]=-ind;
        fun(way[ans[i]]);
    }
    answer(c,x,y);

}
/*

9 9
2 9 8 1 3 7 6 4 5

*/

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

doll.cpp: In function 'bool fnd(int, int)':
doll.cpp:36:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for(int j=0;j<way[i].size();j++)
      |                 ~^~~~~~~~~~~~~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:53:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for(int i=0;i<ans.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