제출 #1021518

#제출 시각아이디문제언어결과실행 시간메모리
1021518MarwenElarbi철로 (IOI14_rail)C++17
0 / 100
51 ms1144 KiB
#include <bits/stdc++.h>
#include "rail.h"
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
void findLocation(int N, int first, int location[], int stype[])
{
    vector<pair<int,int>> a;
    location[0]=first;
    stype[0]=1;
    for (int i = 1; i < N; ++i)
    {
        a.pb({getDistance(0,i),i});
    }
    sort(a.begin(),a.end());
    int left=0;
    int right=a[0].se+first;
    stype[a[0].se]=2;
    location[a[0].se]=a[0].fi;
    for (int i = 1; i < a.size(); ++i)
    {
        int cura=getDistance(left,a[i].se);
        int curb=getDistance(right,a[i].se);
        if(cura>curb){
            location[a[i].se]=location[right]-curb;
            stype[a[i].se]=1;
            left=a[i].se;
        }else{
            location[a[i].se]=location[left]+cura;
            stype[a[i].se]=2;
            right=a[i].se;
        }
    }
    return;
}

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

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for (int i = 1; i < a.size(); ++i)
      |                     ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...