// Knapsack DP is harder than FFT.
#ifndef OWO
#include<bits/stdc++.h>
#endif
#include<bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef int64_t ll;
typedef pair<int,int> pii;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i=0;i<(n);++i)
#define FOO(i,a,b) for(int i=(a);i<=int(b);++i)
#define OOF(i,a,b) for(int i=(a);i>=int(b);--i)
#define AI(x) (x).begin(),(x).end()
template<class I>bool chmax(I&a,I b){return a<b?(a=b,true):false;}
template<class I>bool chmin(I&a,I b){return b<a?(a=b,true):false;}
template<class V>void lisan(V&v){sort(AI(v));v.erase(unique(AI(v)),v.end());}
template<class V,class T>int lspos(const V&v,T x){return lower_bound(AI(v),x)-v.begin();}
template<class...T>void RI(T&...t){(...,(cin>>t));}
template<class...T>void PL(T...t){int c=sizeof...(T);if(!c){cout<<'\n';return;}(...,(cout<<t<<(--c?' ':'\n')));}
constexpr inline ll cdiv(ll x,ll m){return x/m+(x%m?(x<0)^(m>0):0);}
constexpr inline ll mpow(ll x,ll e,ll m){ll r=1;for(x%=m;e;e/=2,x=x*x%m)if(e&1)r=r*x%m;return r;}
#ifdef OWO
#define safe cerr<<"\033[1;32m"<<__PRETTY_FUNCTION__<<" - "<<__LINE__<<" JIZZ\033[0m\n"
#define debug(args...) SDF(#args, args)
#define OIU(args...) ostream& operator<<(ostream&O,args)
#define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}
template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}
template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
#else
#pragma GCC optimize("Ofast")
#define safe ((void)0)
#define debug(...) ((void)0)
#endif
constexpr ll inf = 1e9, INF = 4e18;
vector<pii> ans;
void solve(int l, int r, const vector<pair<int, pii>> & qs){
//if(qs.size() < 20){
vector<pii> p;
for(auto i: qs){
switch(i.ff){
case 1:
ans[i.ss.ss] = p[i.ss.ff];
break;
case 2:
for(auto &j: p){
if(j.ff <= i.ss.ff)
chmin(j.ss, i.ss.ff);
}
break;
case 3:
for(auto &j: p){
if(j.ss >= i.ss.ff)
chmax(j.ff, i.ss.ff);
}
break;
case 4:
p.push_back(i.ss);
break;
}
}
return;
//}
if(l == r){
for(auto i: qs){
if(i.ff == 1)
ans[i.ss.ss] = {l, r};
}
return;
}
}
void convert_input(int n, vector<pair<int, pii>> & qs){
for(auto &i: qs){
switch(i.ff){
case 1:
break;
case 2:
break;
case 3:
i.ss.ff = n - i.ss.ff;
break;
case 4:
auto [x, y] = i.ss;
i.ss = {y, n - x};
break;
}
}
}
void convert_output(int n, vector<pii> & ans){
for(auto &i: ans){
auto [x, y] = i;
i = {n - y, x};
}
}
int32_t main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n, m, q; cin >> n >> m >> q;
vector<pair<int, pii>> qs(m + q);
FOR(i,m){
int x, y; cin >> x >> y;
qs[i] = {4, {x, y}};
}
int ansc = 0;
{
int t, p, a, b;
FOR(i,q){
int t; cin >> t;
switch(t){
case 1:
cin >> p; --p;
qs[i + m] = {t, {p, ansc++}};
break;
case 2:
case 3:
cin >> p;
qs[i + m] = {t, {p, 0}};
break;
case 4:
cin >> a >> b;
qs[i + m] = {t, {a, b}};
}
}
}
ans = vector<pii>(ansc);
convert_input(n, qs);
solve(0, n, qs);
convert_output(n, ans);
for(auto i: ans) cout << i.ff << ' ' << i.ss << '\n';
return 0;
}
Compilation message
sweeping.cpp: In function 'int32_t main()':
sweeping.cpp:114:6: warning: unused variable 't' [-Wunused-variable]
114 | int t, p, a, b;
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
620 KB |
Output is correct |
| 2 |
Correct |
5 ms |
492 KB |
Output is correct |
| 3 |
Correct |
3 ms |
620 KB |
Output is correct |
| 4 |
Correct |
10 ms |
620 KB |
Output is correct |
| 5 |
Correct |
29 ms |
620 KB |
Output is correct |
| 6 |
Correct |
8 ms |
492 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
18051 ms |
46912 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
18029 ms |
46176 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
18029 ms |
46176 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
620 KB |
Output is correct |
| 2 |
Correct |
5 ms |
492 KB |
Output is correct |
| 3 |
Correct |
3 ms |
620 KB |
Output is correct |
| 4 |
Correct |
10 ms |
620 KB |
Output is correct |
| 5 |
Correct |
29 ms |
620 KB |
Output is correct |
| 6 |
Correct |
8 ms |
492 KB |
Output is correct |
| 7 |
Execution timed out |
18051 ms |
46912 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
