# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
916400 |
2024-01-25T19:42:13 Z |
biank |
철로 (IOI14_rail) |
C++14 |
|
55 ms |
848 KB |
#include <bits/stdc++.h>
#include "rail.h"
using namespace std;
#define ALL(x) x.begin(),x.end()
#define forn(i,n) for(int i=0;i<int(n);i++)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define fst first
#define snd second
typedef pair<int,int> ii;
const int C = 1, D = 2;
//int getDistance(int i, int j);
void findLocation(int n, int first, int loc[], int stype[]) {
vector<ii> p(n);
forsn(i,1,n) p[i]={getDistance(0,i),i};
sort(ALL(p));
set<ii> Cs, Ds;
for(auto [d0,i]:p) {
if(Cs.empty()) {
loc[i]=first;
stype[i]=C;
Cs.insert((ii){loc[i],i});
continue;
}
int minC = Cs.begin()->snd;
if(Ds.empty()) {
loc[i]=loc[minC]+d0;
stype[i]=D;
Ds.insert((ii){loc[i],i});
continue;
}
int maxD = Ds.rbegin()->snd;
int distItoC = getDistance(i,minC);
int distItoD = getDistance(maxD,i);
/*loc[i] = loc[minC] + distItoC;
int target = (loc[i] + loc[maxD] - distItoD)/2;
auto it = Cs.lower_bound((ii){target,0});
if(it != Cs.end() && loc[i] - it->fst + loc[maxD] - it->fst == distItoD) {
stype[i] = D;
Ds.insert((ii){loc[i],i});
continue;
}
loc[i] = loc[maxD] - distItoD;
target = (distItoC + loc[i] + loc[minC])/2;
it = Ds.lower_bound((ii){target,0});
if(it != Ds.end() && it->fst - loc[i] + it->fst - loc[minC] == distItoC) {
stype[i] = C;
Cs.insert((ii){loc[i],i});
continue;
}*/
loc[i] = loc[minC] + distItoC;
if(d0 == loc[i] - loc[0]) {
stype[i] = D;
Ds.insert((ii){loc[i],i});
} else {
loc[i] = loc[maxD] - distItoD;
stype[i] = C;
Cs.insert((ii){loc[i],i});
}
}
}
Compilation message
rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:20:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
20 | for(auto [d0,i]:p) {
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
47 ms |
844 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
55 ms |
848 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |