제출 #1085519

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1085519		MMihalev	철로 (IOI14_rail)	C++14	30 / 100	41 ms	648 KiB

rail

#include<iostream>
#include<vector>
#include<algorithm>
#include "rail.h"
using namespace std;
const int MAX_N=5e3+5;
vector<pair<int,int>>leftidx;
vector<pair<int,int>>rightidx;
int lidx;
int ridx;
int n;
int L[MAX_N];
int R[MAX_N];

void findLocation(int N, int first, int location[], int stype[])
{
    n=N;
    location[0]=first;
    stype[0]=1;

    vector<pair<int,int>>v;
    for(int i=1;i<n;i++)
    {
        L[i]=getDistance(0,i);
        v.push_back({L[i],i});
    }
    sort(v.begin(),v.end());

    ridx=v[0].second;
    location[ridx]=first+L[ridx];
    stype[ridx]=2;
    v.clear();
    for(int i=0;i<n;i++)
    {
        if(i==ridx)continue;
        R[i]=getDistance(i,ridx);
        v.push_back({R[i],i});
    }
    sort(v.begin(),v.end());

    lidx=v[0].second;
    location[lidx]=location[ridx]-R[lidx];
    stype[lidx]=1;
    //int minusdist=L[lidx]-2*R[lidx];

    for(int i=0;i<n;i++)
    {
        //if(i!=0)L[i]-=minusdist;
        //else L[i]=getDistance(0,lidx);
        L[i]=getDistance(lidx,i);
    }
    ///L, R, lidx, ridx


    for(int i=0;i<n;i++)
    {
        if(i==lidx or i==ridx)continue;

        if(L[i]>R[i])
        {
            leftidx.push_back({L[i],i});
        }
        else rightidx.push_back({R[i],i});
    }
    sort(leftidx.begin(),leftidx.end());
    sort(rightidx.begin(),rightidx.end());
    ///leftidx, rightidx


    for(int type=1;type<=2;type++)
    {
        if(type==1)
        {
            v=leftidx;
            if(v.size()==0)continue;

            int idxsame=v[0].second;
            int distsame=v[0].first;
            location[idxsame]=location[lidx]-(distsame-2*R[lidx]);
            stype[idxsame]=type;

            for(int i=1;i<v.size();i++)
            {
                int dif=abs(distsame-v[i].first);

                if(dif==getDistance(idxsame,v[i].second))
                {
                    location[v[i].second]=location[idxsame]+dif;
                    stype[v[i].second]=type;
                }
                else
                {
                    location[v[i].second]=location[idxsame]-dif;
                    stype[v[i].second]=type;

                    idxsame=v[i].second;
                    distsame=v[i].first;
                }
            }
        }
        else
        {
            v=rightidx;
            if(v.size()==0)continue;

            int idxsame=v[0].second;
            int distsame=v[0].first;
            stype[idxsame]=type;
            location[idxsame]=location[ridx]+(distsame-2*R[lidx]);

            for(int i=1;i<v.size();i++)
            {
                int dif=abs(distsame-v[i].first);

                if(dif==getDistance(idxsame,v[i].second))
                {
                    location[v[i].second]=location[idxsame]-dif;
                    stype[v[i].second]=type;
                }
                else
                {
                    location[v[i].second]=location[idxsame]+dif;
                    stype[v[i].second]=type;

                    idxsame=v[i].second;
                    distsame=v[i].first;
                }
            }
        }
    }
}

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

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:82:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |             for(int i=1;i<v.size();i++)
      |                         ~^~~~~~~~~
rail.cpp:111:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |             for(int i=1;i<v.size();i++)
      |                         ~^~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 22 / 22
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44