# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
63444 |
2018-08-01T19:55:25 Z |
knon0501 |
None (KOI18_matrix) |
C++11 |
|
4000 ms |
174384 KB |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
int n,m;
const int MX=2e5+5;
pair<int,pair<int,int>> a[MX];
unordered_map<long long,int> seg;
unordered_map<int,int> xx;
unordered_map<int,int> yy;
long long nn;
int ans;
int p;
inline int g(int y,int lef,int rig,int lev1,int lev2){
stack<int> S;
S.push(lef);
S.push(rig);
S.push(lev2);
int k=0;
while(!S.empty()){
int lv=S.top();S.pop();
int r=S.top();S.pop();
int l=S.top();S.pop();
if(l>=y)continue;
if(r<y)k=max(k,seg[nn*2*lev1+lv]);
else{
S.push(l);
S.push((l+r)/2);
S.push(lv*2);
S.push((l+r)/2+1);
S.push(r);
S.push(lv*2+1);
}
}
return k;
}
inline int f(int x,int y,int lef,int rig,int lev){
stack<int> S;
S.push(lef);
S.push(rig);
S.push(lev);
int k=0;
while(!S.empty()){
int lv=S.top();S.pop();
int r=S.top();S.pop();
int l=S.top();S.pop();
if(l>=x)continue;
if(r<x)k=max(k,g(y,1,nn,lv,1));
else{
S.push(l);
S.push((l+r)/2);
S.push(lv*2);
S.push((l+r)/2+1);
S.push(r);
S.push(lv*2+1);
}
}
return k;
}
void process(){
int i,j;
for(nn=1 ; nn<n ; nn*=2);
for(i=1 ; i<=n ; i++)cin>>a[i].f;
for(i=1 ; i<=n ; i++)cin>>a[i].s.f;
for(i=1 ; i<=n ; i++)cin>>a[i].s.s;
sort(a+1,a+n+1);
set<int> S1;
set<int> S2;
for(i=1 ; i<=n ; i++){
S1.insert(a[i].s.f);
S2.insert(a[i].s.s);
}
int cnt=0;
for(auto &i:S1)xx[i]=++cnt;
cnt=0;
for(auto &i:S2)yy[i]=++cnt;
for(int ii=1 ; ii<=n ; ii++){
int k=f(xx[a[ii].s.f],yy[a[ii].s.s],1,nn,1)+1;
for(i=nn+xx[a[ii].s.f]-1 ; i>=1 ; i/=2){
for(j=nn+yy[a[ii].s.s]-1 ; j>=1 ; j/=2)
seg[nn*2*i+j]=seg[nn*2*i+j]>k ? seg[nn*2*i+j]:k;
}
ans=ans>k?ans:k;
}
cout<<ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>m>>n;
if(m==3)process();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
748 ms |
34548 KB |
Output is correct |
2 |
Correct |
555 ms |
34548 KB |
Output is correct |
3 |
Correct |
1319 ms |
53088 KB |
Output is correct |
4 |
Correct |
1669 ms |
60844 KB |
Output is correct |
5 |
Correct |
1091 ms |
60844 KB |
Output is correct |
6 |
Correct |
473 ms |
60844 KB |
Output is correct |
7 |
Correct |
1559 ms |
60844 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
748 ms |
34548 KB |
Output is correct |
2 |
Correct |
555 ms |
34548 KB |
Output is correct |
3 |
Correct |
1319 ms |
53088 KB |
Output is correct |
4 |
Correct |
1669 ms |
60844 KB |
Output is correct |
5 |
Correct |
1091 ms |
60844 KB |
Output is correct |
6 |
Correct |
473 ms |
60844 KB |
Output is correct |
7 |
Correct |
1559 ms |
60844 KB |
Output is correct |
8 |
Execution timed out |
4059 ms |
174384 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |