# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
119770 | errorgorn | Bitaro, who Leaps through Time (JOI19_timeleap) | C++14 | 1480 ms | 269684 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
#include <utility>
using namespace std;
typedef pair<int,int> ii;
int n;
ii input[300005];
inline int read() {
int x = 0;
char ch = getchar_unlocked();
while (ch >= '0' && ch <= '9'){
x = (x << 3) + (x << 1) + ch - '0';
ch = getchar_unlocked();
}
return x;
}
struct stats{
int l_time,r_time;
long long time_used;
long long powers_used;
stats(int a,int b,int c, int d){
l_time=a;
r_time=b;
time_used=c;
powers_used=d;
}
stats(stats *i, stats *j){
unions(i,j);
}
stats(stats *i){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |