oj.uz

답안 #958845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958845 2024-04-07T01:07:27 Z 12345678 팀들 (IOI15_teams) C++17
13 / 100
 4000 ms 19220 KB 
#include "teams.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;
int n, cur;
vector<pair<int, int>> v;

void init(int N, int A[], int B[]) {
	n=N;
	for (int i=0; i<N; i++) v.push_back({A[i], B[i]});
	sort(v.begin(), v.end());
}

int can(int M, int K[]) {
	sort(K, K+M);
	cur=0;
    priority_queue<int, vector<int>, greater<int>> pq;
    for (int i=0; i<M; i++)
    {
        while (cur<n&&v[cur].first<=K[i]) pq.push(v[cur++].second);
        while (pq.top()<K[i]) pq.pop();
        if (pq.size()<K[i]) return 0;
        while (K[i]--) pq.pop();
    }
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:24:22: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |         if (pq.size()<K[i]) return 0;
      |             ~~~~~~~~~^~~~~

Subtask #1
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Execution timed out 4097 ms 436 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 3536 KB Output is correct
2 Correct 13 ms 3540 KB Output is correct
3 Correct 21 ms 3960 KB Output is correct
4 Correct 15 ms 3540 KB Output is correct
5 Correct 12 ms 3004 KB Output is correct
6 Correct 13 ms 3024 KB Output is correct
7 Correct 10 ms 3028 KB Output is correct
8 Correct 10 ms 3028 KB Output is correct
9 Correct 9 ms 3792 KB Output is correct
10 Correct 8 ms 3280 KB Output is correct
11 Correct 8 ms 3276 KB Output is correct
12 Correct 8 ms 3536 KB Output is correct
13 Correct 15 ms 3296 KB Output is correct
14 Correct 14 ms 3792 KB Output is correct
15 Correct 14 ms 3384 KB Output is correct
16 Correct 14 ms 3280 KB Output is correct
17 Correct 13 ms 3284 KB Output is correct
18 Correct 14 ms 3280 KB Output is correct

Subtask #3
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 3796 KB Output is correct
2 Correct 21 ms 3788 KB Output is correct
3 Execution timed out 4035 ms 4672 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 16224 KB Output is correct
2 Correct 84 ms 16436 KB Output is correct
3 Execution timed out 4081 ms 19220 KB Time limit exceeded
4 Halted 0 ms 0 KB -