# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
589096 | berr | Fountain (eJOI20_fountain) | C++17 | 647 ms | 61236 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 <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, q; cin>>n>>q;
vector<array<int, 2>> a(n+1);
for(int i=0; i<n; i++)
{
cin>>a[i][0]>>a[i][1];
}
stack<array<int, 2>> s;
vector<vector<array<int, 2>>> st(n+1, vector<array<int, 2>>(31));
s.push({(int)(1e13), n});
int p=1e13;
a[n]={p,p};
s.push({a[n-1][0], n-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... |