제출 #848350

#제출 시각아이디문제언어결과실행 시간메모리
848350vjudge1Unija (COCI17_unija)C++17
0 / 100
39 ms65536 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;
    long long p[10000001]={};
    for(int i=0 ; i<n ; i++)
    {
        long long x,y;
        cin>>x>>y;
        y/=2; x/=2;
        // v[i]={x,y};
        p[y]=max(p[y],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=0 ; 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...