Submission #146132

#TimeUsernameProblemLanguageResultExecution timeMemory
146132cheetoseMatryoshka (JOI16_matryoshka)C++11
0 / 100
3 ms504 KiB
#include<cstdio> #include<cstdlib> #include<iostream> #include<vector> #include<queue> #include<bitset> #include<string> #include<stack> #include<set> #include<unordered_set> #include<map> #include<unordered_map> #include<cstring> #include<complex> #include<cmath> #include<iomanip> #include<numeric> #include<algorithm> #include<list> #include<functional> #include<cassert> #define mp make_pair #define pb push_back #define X first #define Y second #define y0 y12 #define y1 y22 #define INF 987654321987654321 #define PI 3.141592653589793238462643383279502884 #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c)) #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c)) #define MEM0(a) memset((a),0,sizeof(a)); #define MEM_1(a) memset((a),-1,sizeof(a)); #define ALL(a) a.begin(),a.end() #define SYNC ios_base::sync_with_stdio(false);cin.tie(0) using namespace std; typedef long long ll; typedef long double ld; typedef double db; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int, int> Pi; typedef pair<ll, ll> Pll; typedef pair<ld, ld> Pd; typedef vector<int> Vi; typedef vector<ll> Vll; typedef vector<double> Vd; typedef vector<Pi> VPi; typedef vector<Pll> VPll; typedef vector<Pd> VPd; typedef tuple<int, int, int> iii; typedef tuple<int,int,int,int> iiii; typedef tuple<ll, ll, ll> LLL; typedef vector<iii> Viii; typedef vector<LLL> VLLL; typedef complex<double> base; const ll MOD = 1000000007; ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; } ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); } int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 }; int n,q; int ans[200000]; pair<Pi,int> Q[200000]; Pi p[200000]; Vi vv; int tree[1048576]; void upd(int node, int S, int E, int k, int dif) { if (S == E) { tree[node]=max(tree[node],dif); return; } if (k <= (S + E) / 2)upd(node * 2, S, (S + E) / 2, k, dif); else upd(node * 2 + 1, (S + E) / 2 + 1, E, k, dif); tree[node]=max(tree[node*2],tree[node*2+1]); } int find(int node, int S, int E, int i, int j) { if (i > E || j < S)return 0; if (i <= S && j >= E)return tree[node]; return max(find(node * 2, S, (S + E) / 2, i, j), find(node * 2 + 1, (S + E) / 2 + 1, E, i, j)); } int main() { scanf("%d%d",&n,&q); fup(i,0,n-1,1) { scanf("%d%d",&p[i].X,&p[i].Y); vv.pb(p[i].Y); } fup(i,0,q-1,1) { scanf("%d%d",&Q[i].X.X,&Q[i].X.Y); Q[i].Y=i; vv.pb(Q[i].X.Y); } sort(ALL(vv));vv.resize(unique(ALL(vv))-vv.begin()); int N=vv.size(); fup(i,0,n-1,1)p[i].Y=lower_bound(ALL(vv),p[i].Y)-vv.begin()+1; fup(i,0,q-1,1)Q[i].X.Y=lower_bound(ALL(vv),Q[i].X.Y)-vv.begin()+1; sort(p,p+n,[&](Pi p1,Pi p2){ if(p1.X!=p2.X)return p1.X>p2.X; return p1.Y<p2.Y; }); sort(Q,Q+q,[&](pair<Pi,int> p1,pair<Pi,int> p2){ if(p1.X.X!=p2.X.X)return p1.X.X>p2.X.X; return p1.X.Y<p2.X.Y; }); for(int i=0,j=0;i<q;i++) { while(j<n && (Q[i].X.X<p[j].X || (Q[i].X.X==p[j].X && Q[i].X.Y>p[j].Y))) { int t=find(1,1,N,1,p[j].Y-1); upd(1,1,N,p[j].Y,t+1); j++; } int t=find(1,1,N,1,Q[i].X.Y); ans[Q[i].Y]=t; } fup(i,0,q-1,1)printf("%d\n",ans[i]); }

Compilation message (stderr)

matryoshka.cpp: In function 'int main()':
matryoshka.cpp:88:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&q);
  ~~~~~^~~~~~~~~~~~~~
matryoshka.cpp:91:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&p[i].X,&p[i].Y);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
matryoshka.cpp:96:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&Q[i].X.X,&Q[i].X.Y);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...