Submission #2120902
Source Code Expand
// G++ MACRO.CPP -STD=C++14
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])
#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) for(auto&youso_: (x) )cout<<youso_<<" ";cout<<endl
#define ALL(obj) (obj).begin(),(obj).end()
#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
cin>>head;
CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
template <class T = ll>
T IN(){T x;cin>>x;return (x);}
template <class Head>
void VT(Head head){}
template <class Head,class Seco,class... Tail>
void VT(Head&& head,Seco&& seco,Tail&&... tail){
seco.resize(head);
VT(head,move(tail)...);
}
void VT2(){}
template <class Head,class... Tail>
void VT2(Head&& head,Tail&&... tail){
VECCIN(head);
VT2(move(tail)...);
}
template <class Head>
void VT3(Head&& head){}
template <class Head,class Seco,class... Tail>
void VT3(Head&& head,Seco&& seco,Tail&&... tail){
seco[head]=IN();
VT3(head,move(tail)...);
}
#define VC1(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);VT2(__VA_ARGS__); //aaabbbccc
#define VC2(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);REP(i,n)VT3(i,__VA_ARGS__); //abcabcabc
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision; // cpp_int
#define P pair<int,int>
#define V vector<int>
#define M map<int,int>
#define S set<int>
#define PQ priority_queue<int>
#define PQG priority_queue<int,V,greater<int>>
#define pb(a) push_back(a)
#define mp make_pair
class Dijkstra{
public:
Dijkstra(vector<M> ed,int firs,int pnum);
void Solve();
V range;// range[a]=b;
vector<M> edges;// [a][b]=c;
priority_queue<P,vector<P>,greater<P>> que;// queue=(range,point);
};
Dijkstra::Dijkstra(vector<M> ed,int firs,int pnum){
edges=ed;
V ttt(pnum,-INF);
range=ttt;
range[firs]=1;
que.push(mp(0,firs));
}
void Dijkstra::Solve(){
while(!que.empty()){
P top_=que.top();
que.pop();
FOREACH(x,edges[top_.second]){
if(range[x.first] < range[top_.second] + x.second){
range[x.first] = range[top_.second] + x.second;
que.push(mp(range[x.first],x.first));
}
}
}
}
int main(){
CIN(n);VC2(n,a,b);
vector<M> edges(n);
REP(i,n)FOR(j,i+1,n){
if(a[i]<a[j]&&b[i]<b[j])edges[j][i]=1;
if(a[i]>a[j]&&b[i]>b[j])edges[i][j]=1;
}
int ans=0;
REP(ii,n){
Dijkstra dijk(edges,ii,n);
dijk.Solve();
REP(i,n)ans=max(ans,dijk.range[i]);
}
COUT(ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
D - プレゼント |
User |
shibh308 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3722 Byte |
Status |
TLE |
Exec Time |
2159 ms |
Memory |
922752 KB |
Judge Result
Set Name |
Sample |
Subtask0 |
All |
Score / Max Score |
0 / 0 |
0 / 30 |
0 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
sample0.txt, sample1.txt, sample2.txt, sample3.txt |
Subtask0 |
subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, sample0.txt, sample1.txt, sample2.txt, sample3.txt |
All |
sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample0.txt |
AC |
1 ms |
256 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |
sample3.txt |
AC |
1 ms |
256 KB |
subtask0_0.txt |
AC |
1846 ms |
7500 KB |
subtask0_1.txt |
AC |
14 ms |
532 KB |
subtask0_10.txt |
TLE |
2108 ms |
70656 KB |
subtask0_11.txt |
AC |
19 ms |
384 KB |
subtask0_12.txt |
TLE |
2104 ms |
36744 KB |
subtask0_13.txt |
TLE |
2104 ms |
35240 KB |
subtask0_14.txt |
TLE |
2104 ms |
35448 KB |
subtask0_2.txt |
AC |
47 ms |
792 KB |
subtask0_3.txt |
AC |
308 ms |
1912 KB |
subtask0_4.txt |
TLE |
2104 ms |
21864 KB |
subtask0_5.txt |
AC |
66 ms |
912 KB |
subtask0_6.txt |
TLE |
2108 ms |
25328 KB |
subtask0_7.txt |
TLE |
2104 ms |
33092 KB |
subtask0_8.txt |
TLE |
2104 ms |
24260 KB |
subtask0_9.txt |
AC |
1486 ms |
4840 KB |
subtask1_0.txt |
TLE |
2123 ms |
319616 KB |
subtask1_1.txt |
TLE |
2110 ms |
117160 KB |
subtask1_10.txt |
TLE |
2159 ms |
922752 KB |
subtask1_11.txt |
TLE |
2103 ms |
5760 KB |
subtask1_12.txt |
TLE |
2123 ms |
318976 KB |
subtask1_13.txt |
TLE |
2122 ms |
300032 KB |
subtask1_14.txt |
TLE |
2123 ms |
321920 KB |
subtask1_2.txt |
TLE |
2130 ms |
395264 KB |
subtask1_3.txt |
TLE |
2123 ms |
326912 KB |
subtask1_4.txt |
TLE |
2123 ms |
311808 KB |
subtask1_5.txt |
TLE |
2127 ms |
388224 KB |
subtask1_6.txt |
TLE |
2119 ms |
279168 KB |
subtask1_7.txt |
TLE |
2123 ms |
318592 KB |
subtask1_8.txt |
TLE |
2124 ms |
337152 KB |
subtask1_9.txt |
TLE |
2125 ms |
339072 KB |