# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
170546 | 2019-12-25T15:31:42 Z | mdn2002 | Unija (COCI17_unija) | C++14 | 976 ms | 65540 KB |
#include<bits/stdc++.h> using namespace std; const long long mod=998244353; multiset<int>ms; int n,k; map<int,int>a; vector<int>v[1000000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("lemonade.in","r",stdin); //freopen("lemonade.out","w",stdout); cin>>n; for(int i=0;i<n;i++) { int x,y; cin>>x>>y; x/=2; y/=2; if(a[y+1]==0)a[y+1]=++k; ms.insert(x); v[a[y+1]].push_back(x); } long long ans=0; for(int i=1;i<=10000004;i++) { for(int j=0;j<v[a[i]].size();j++) { ms.erase(ms.find(v[a[i]][j])); } if(ms.size()==0)break; ans+=*--ms.end(); } cout<<ans*4; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 23800 KB | Output is correct |
2 | Correct | 22 ms | 23800 KB | Output is correct |
3 | Correct | 24 ms | 23800 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 23800 KB | Output is correct |
2 | Correct | 28 ms | 23928 KB | Output is correct |
3 | Correct | 23 ms | 23772 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 23928 KB | Output is correct |
2 | Correct | 24 ms | 23928 KB | Output is correct |
3 | Correct | 24 ms | 23928 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 24312 KB | Output is correct |
2 | Correct | 30 ms | 24312 KB | Output is correct |
3 | Correct | 30 ms | 24284 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 742 ms | 65540 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 23800 KB | Output is correct |
2 | Correct | 23 ms | 23800 KB | Output is correct |
3 | Correct | 23 ms | 23800 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 76 ms | 27000 KB | Output is correct |
2 | Correct | 76 ms | 27000 KB | Output is correct |
3 | Correct | 75 ms | 27000 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 251 ms | 34492 KB | Output is correct |
2 | Correct | 274 ms | 34552 KB | Output is correct |
3 | Correct | 255 ms | 34348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 888 ms | 55668 KB | Output is correct |
2 | Correct | 903 ms | 55772 KB | Output is correct |
3 | Correct | 976 ms | 55772 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 803 ms | 65540 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |