# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467487 | myvaluska | Fountain (eJOI20_fountain) | C++14 | 450 ms | 32668 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 <string>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 100037;
const int logn = 17;
const int inf = 1000'000'037;
vector<vector<int>>p(logn,vector<int>(maxn,0));
vector<vector<int>>suc(logn, vector<int>(maxn, 0));
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
int q;
cin >> n;
cin >> q;
vector<int>d(n + 2);
vector<int>c(n + 2);
vector<int>r(n + 2);
vector<int>v(n + 2);
d[0] = inf;
c[0] = inf;
for (int i = 1; i < n + 1; i++)
{
cin >> d[i];
cin >> c[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... |