# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
795609 |
2023-07-27T11:39:13 Z |
medmdg |
Rail (IOI14_rail) |
C++14 |
|
45 ms |
468 KB |
#include <bits/stdc++.h>
#pragma once
#include "rail.h"
using ll =long long;
ll LINF=1000000000000000000;
int INF=1000000000;
#define pi pair<int,int>
#define pl pair<ll,ll>
#define endl '\n'
#define vi vector<int>
#define vii vector<vector<int>>
#define vl vector<ll>
#define vll vector<vector<ll>>
using namespace std;
int minind(vi &v){
int mn=v[0];
int m=0;
for(int i=1;i<v.size();i++){
if(v[i]<mn){
mn=v[i];
m=i;
}
}
return m;
}
int getDistance(int i, int j);
void findLocation(int n, int first, int location[], int stype[]){
for(int i=0;i<n;i++){
location[i]=0;
stype[i]=0;
}
vi d0(n),ds(n);
for(int i=1;i<n;i++){
d0[i]= getDistance(0,i);
}
d0[0]=INF;
int second=minind(d0);
d0[0]=0;
for(int i=1;i<n;i++){
if(i==second)continue;
int dist= getDistance(i,second);
ds[i]=dist;
}
stype[0]=1;
stype[second]=2;
location[0]=first;
location[second]=first+d0[second];
vector<pi>right,left;
for(int i=0;i<n;i++){
if(stype[i])continue;
if(d0[i]>ds[i]){
left.push_back(make_pair(ds[i],i));
}
else right.push_back(make_pair(d0[i],i));
}
std::sort(right.begin(), right.end());
std::sort(left.begin(), left.end());
int last=second;
for(auto p:right){
int i=p.second;
int dist= getDistance(i,last);
if(d0[i]>dist){
stype[i]=1;
location[i]= location[last]-dist;
}
else{
stype[i]=2;
location[i]=first+d0[i];
last=i;
}
}
if(left.size()){
last = left[0].second;
stype[last]=1;
location[last]=location[second]-ds[last];
}
for( auto p:left){
int i=p.second;
if(i==last)continue;
int dist= getDistance(i,last);
if(ds[i]>dist){
stype[i]=2;
location[i]=location[last]+dist;
}
else {
stype[i]=1;
location[i]=location[second]-ds[i];
last=i;
}
}
}
Compilation message
rail.cpp:2:9: warning: #pragma once in main file
2 | #pragma once
| ^~~~
rail.cpp: In function 'int minind(std::vector<int>&)':
rail.cpp:20:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
20 | for(int i=1;i<v.size();i++){
| ~^~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
0 ms |
340 KB |
Output is correct |
10 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
0 ms |
340 KB |
Output is correct |
10 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
45 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
45 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |