# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
908198 | zyq181 | Fountain (eJOI20_fountain) | C++17 | 200 ms | 19360 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>
#include <fstream>
using namespace std;
#define int long long
const int MOD = 998244353;
//stack: value, suff
int N,Q;
int inp1, inp2;
vector<pair<int, int> > v; //reversed original {d, c}
vector<pair<int, pair<int, int> > > s; //{d, {suff, idx} }
vector<pair<int, pair<int, int> > > q; //sorted in decreasing index {idx, {wtr, qid} }
int ans[200010];
int32_t main(){
//ios::sync_with_stdio(0);
//cin.tie(0);
cin >> N >> Q;
for(int a=0; a<N; a++){
cin >> inp1 >> inp2;
v.push_back({inp1, inp2});
}
reverse(v.begin(), v.end());
for(int a=0; a<Q; a++){
cin >> inp1 >> inp2;
q.push_back({inp1, {inp2, a}});
}
sort(q.begin(), q.end());
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |