# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
170562 | 2019-12-25T15:52:30 Z | mdn2002 | Unija (COCI17_unija) | C++14 | 1000 ms | 33180 KB |
#include<bits/stdc++.h> using namespace std; const long long mod=998244353; multiset<int>ms; int n,k; map<int,int>a; int v[1000006]; vector<int>b; int main() { //ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("lemonade.in","r",stdin); //freopen("lemonade.out","w",stdout); scanf("%d",&n); for(int i=0;i<n;i++) { int x,y; scanf("%d",&x); scanf("%d",&y); x/=2; y/=2; if(a[y+1]==0) { a[y+1]=++k; b.push_back(y+1); } if(v[a[y+1]]==0) { v[a[y+1]]=x; continue; } if(v[a[y+1]]<x)v[a[y+1]]=x; } for(int i=0;i<b.size();i++)ms.insert(v[a[b[i]]]); sort(b.begin(),b.end()); long long ans=0; for(int i=0;i<b.size();i++) { int z=b[i],z1; if(i>0)z1=b[i-1]; else z1=1; ans+=*--ms.end()*(z-z1); if(v[a[z]]!=0) { int x=v[a[z]]; ms.erase(ms.lower_bound(x)); } if(ms.size()==0)break; } cout<<ans*4; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 424 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 376 KB | Output is correct |
3 | Correct | 3 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 632 KB | Output is correct |
2 | Correct | 8 ms | 632 KB | Output is correct |
3 | Correct | 8 ms | 632 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1083 ms | 33180 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 50 ms | 2680 KB | Output is correct |
2 | Correct | 51 ms | 2648 KB | Output is correct |
3 | Correct | 50 ms | 2680 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 207 ms | 7920 KB | Output is correct |
2 | Correct | 207 ms | 8048 KB | Output is correct |
3 | Correct | 208 ms | 8044 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 873 ms | 23432 KB | Output is correct |
2 | Correct | 886 ms | 23388 KB | Output is correct |
3 | Correct | 873 ms | 23328 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1085 ms | 32740 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |