# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
120126 |
2019-06-23T13:38:15 Z |
rajarshi_basu |
Rail (IOI14_rail) |
C++14 |
|
74 ms |
512 KB |
#include <bits/stdc++.h>
#define ll long long int
#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i = a;i<=b;i++)
#define vi vector<int>
#define ii pair<int,int>
#define ff first
#define ss second
#include "rail.h"
using namespace std;
void findLocation(int n, int first, int location[], int stype[]){
location[0] = 0;
FOR(i,n-1){
location[i+1] = first + getDistance(0,i+1);
}
stype[0] = 1;
FOR(i,n-1)stype[i+1] = 2;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
71 ms |
508 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
74 ms |
512 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |