oj.uz

답안 #769019

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
769019 2023-06-29T05:10:39 Z vjudge1 팀들 (IOI15_teams) C++17
34 / 100
 4000 ms 16244 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
pair<int, int> people[600000];
int n;
void init(int N, int A[], int B[]) {
	n=N;
	for(int i = 0; i < n; i++)
        people[i]={A[i], B[i]};
	sort(people,people+N);
}
int can(int M, int K[]) {
	sort(K,K+M);
	priority_queue<pair<int, int>,vector<pair<int, int>>,greater<pair<int, int>>>q;
	int cur=0;
	for(int i = 0; i < M; i++){
		int x=K[i];
		while(cur<n&&people[cur].first<=x)
            q.push({people[cur].second,people[cur].first}),cur++;
		while(!q.empty()&&q.top().first<x)q.pop();
		if(q.size()<x)return 0;
		while(x--) q.pop();
	}
	return 1;
}

Compilation message

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

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1892 KB Output is correct
2 Correct 12 ms 1876 KB Output is correct
3 Correct 20 ms 3032 KB Output is correct
4 Correct 14 ms 2260 KB Output is correct
5 Correct 12 ms 1856 KB Output is correct
6 Correct 13 ms 1916 KB Output is correct
7 Correct 9 ms 1876 KB Output is correct
8 Correct 9 ms 1884 KB Output is correct
9 Correct 13 ms 3148 KB Output is correct
10 Correct 12 ms 3020 KB Output is correct
11 Correct 12 ms 3036 KB Output is correct
12 Correct 13 ms 3036 KB Output is correct
13 Correct 18 ms 2512 KB Output is correct
14 Correct 15 ms 3028 KB Output is correct
15 Correct 13 ms 2016 KB Output is correct
16 Correct 14 ms 1876 KB Output is correct
17 Correct 15 ms 2224 KB Output is correct
18 Correct 16 ms 2272 KB Output is correct

Subtask #3
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 2272 KB Output is correct
2 Correct 17 ms 2260 KB Output is correct
3 Execution timed out 4070 ms 3856 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 8912 KB Output is correct
2 Correct 77 ms 8896 KB Output is correct
3 Execution timed out 4083 ms 16244 KB Time limit exceeded
4 Halted 0 ms 0 KB -