# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
619348 | 2022-08-02T11:21:32 Z | amin | 팀들 (IOI15_teams) | C++14 | 4000 ms | 14504 KB |
#include "teams.h" #include<bits/stdc++.h> using namespace std; vector<pair<long,long> >v; vector<pair<long,long> >vv; long p[200002]; long o[200002]; void init(int N, int A[], int B[]) { for(long i=0;i<N;i++) { vv.push_back({A[i],B[i]}); o[B[i]]--; vv.push_back({B[i],1000000000}); } } int can(int M, int K[]) { v=vv; for(long i=0;i<200002;i++) { p[i]=o[i]; } for(long i=0;i<M;i++) { v.push_back({K[i],999999999}); } sort(v.begin(),v.end()); long c=0; priority_queue<long>pq; for(long i=0;i<v.size();i++) { if(v[i].second==999999999) { // cout<<c<<' '; c-=v[i].first; // cout<<c<<endl; if(c<0) { return 0; } for(long y=0;y<v[i].first;y++) { p[-pq.top()]++; pq.pop(); } }else if(v[i].second==1000000000) { if(p[v[i].first]<0) { pq.pop(); p[v[i].first]++; c--; } }else { pq.push(-v[i].second); c++; } } return 1; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1876 KB | Output is correct |
2 | Correct | 1 ms | 1876 KB | Output is correct |
3 | Correct | 8 ms | 1876 KB | Output is correct |
4 | Correct | 7 ms | 1900 KB | Output is correct |
5 | Correct | 8 ms | 1876 KB | Output is correct |
6 | Correct | 2 ms | 2248 KB | Output is correct |
7 | Correct | 8 ms | 1876 KB | Output is correct |
8 | Correct | 7 ms | 1876 KB | Output is correct |
9 | Correct | 7 ms | 1876 KB | Output is correct |
10 | Correct | 7 ms | 1876 KB | Output is correct |
11 | Correct | 1 ms | 1848 KB | Output is correct |
12 | Correct | 12 ms | 1856 KB | Output is correct |
13 | Correct | 11 ms | 1904 KB | Output is correct |
14 | Correct | 12 ms | 1848 KB | Output is correct |
15 | Correct | 10 ms | 1848 KB | Output is correct |
16 | Correct | 8 ms | 1876 KB | Output is correct |
17 | Correct | 10 ms | 1892 KB | Output is correct |
18 | Correct | 7 ms | 1888 KB | Output is correct |
19 | Correct | 6 ms | 1860 KB | Output is correct |
20 | Correct | 6 ms | 1876 KB | Output is correct |
21 | Correct | 7 ms | 1876 KB | Output is correct |
22 | Correct | 7 ms | 1884 KB | Output is correct |
23 | Correct | 6 ms | 1876 KB | Output is correct |
24 | Correct | 6 ms | 1848 KB | Output is correct |
25 | Correct | 7 ms | 1888 KB | Output is correct |
26 | Correct | 6 ms | 1876 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 32 ms | 12864 KB | Output is correct |
2 | Correct | 32 ms | 12972 KB | Output is correct |
3 | Correct | 43 ms | 12992 KB | Output is correct |
4 | Correct | 46 ms | 14504 KB | Output is correct |
5 | Correct | 25 ms | 12864 KB | Output is correct |
6 | Correct | 25 ms | 12860 KB | Output is correct |
7 | Correct | 24 ms | 12992 KB | Output is correct |
8 | Correct | 26 ms | 12976 KB | Output is correct |
9 | Correct | 22 ms | 12940 KB | Output is correct |
10 | Correct | 25 ms | 12724 KB | Output is correct |
11 | Correct | 21 ms | 12772 KB | Output is correct |
12 | Correct | 23 ms | 12864 KB | Output is correct |
13 | Correct | 35 ms | 13100 KB | Output is correct |
14 | Correct | 35 ms | 13720 KB | Output is correct |
15 | Correct | 41 ms | 14008 KB | Output is correct |
16 | Correct | 34 ms | 14040 KB | Output is correct |
17 | Correct | 29 ms | 13912 KB | Output is correct |
18 | Correct | 33 ms | 13924 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 4082 ms | 12924 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 32 ms | 8364 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |