제출 #848343

#제출 시각아이디문제언어결과실행 시간메모리
848343vjudge1Unija (COCI17_unija)C++17
0 / 100
597 ms52220 KiB
#include <bits/stdc++.h> using namespace std; int main() { long long n,cnt=0; cin>>n; // vector<pair<long long,long long>>v(n); // map<int,int>p; int p[10000001]={}; for(int i=0 ; i<n ; i++) { long long x,y,z; cin>>x>>y; y/=2; x/=2; // v[i]={x,y}; z=p[y]; p[y]=max(z,x); } for(int i=10000001-1 ; i>0 ; i--) p[i]=max(p[i],p[i+1]); // for(auto i:p) cnt+=i.second; for(int i=1 ; i<10000001 ; i++)cnt+=p[i]; cout<<cnt*4<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...