# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17465 | AZE_XeRoX | Divide and conquer (IZhO14_divide) | C++98 | 146 ms | 4720 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 <iostream>
#include <cmath>
#include <iomanip>
#include <algorithm>
#define intt long long int
#define MAXN 100001
using namespace std;
intt n;
int main()
{
long long x[MAXN], g[MAXN], d[MAXN], p[MAXN];
cin >> n ;
for (intt i=1; i<=n; i++) {
cin >> x[i] >> g[i] >> d[i] ;
g[i] += g[i-1];
d[i] += d[i-1];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |