# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
888975 |
2023-12-18T14:18:08 Z |
aguss |
Rail (IOI14_rail) |
C++14 |
|
47 ms |
632 KB |
#include "rail.h"
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#define endl "\n"
#define sp " "
#define f1(i, x) for(auto &i : x)
#define f2(i, x) for(ll i = 0; i < x; i++)
#define raya() cout << endl << "====================================" << endl
using namespace std;
typedef long long ll;
void findLocation(int N, int first, int location[], int stype[]){
vector<pair<int, int>> arr;
for(int i = 1; i <= N; i++)
arr.push_back({i, getDistance(first, i)});
for(int i = 0; i < N; i++){
location[arr[i].first - 1] = arr[i].second + 1;
stype[i] = 2;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
47 ms |
628 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
43 ms |
632 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |