# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
942940 | guagua0407 | Sweeping (JOI20_sweeping) | C++17 | 18091 ms | 18896 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.
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
struct qry{
int t,a,b;
};
const int mxn=2e6+5;
const int inf=1e9+5;
int x[mxn],y[mxn];
int main() {_
int n,m,q;
cin>>n>>m>>q;
for(int i=1;i<=m;i++){
cin>>x[i]>>y[i];
}
//cout<<'\n';
for(int i=0;i<q;i++){
int t,v;
cin>>t>>v;
if(t==1){
cout<<x[v]<<' '<<y[v]<<'\n';
}
else if(t==2){
for(int j=1;j<=m;j++){
if(y[j]<=v) x[j]=max(x[j],n-v);
}
}
else if(t==3){
for(int j=1;j<=m;j++){
if(x[j]<=v) y[j]=max(y[j],n-v);
}
}
else{
int u;
cin>>u;
x[++m]=v;
y[m]=u;
}
}
return 0;
}
//maybe its multiset not set
//yeeorz
//laborz
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |