oj.uz

답안 #756597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756597 2023-06-12T01:07:54 Z minhcool 팀들 (IOI15_teams) C++17
34 / 100
 4000 ms 13132 KB 
//#define local
#ifndef local
#include "teams.h"
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

mt19937 rng(1);

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}

int n;
ii range[N];

void init(int N, int A[], int B[]){
	n = N;
	for(int i = 1; i <= n; i++) range[i] = {A[i - 1], B[i - 1]};
	sort(range + 1, range + n + 1);
}

int can(int m, int k[]){
	sort(k, k + m);
	int itr = 1;
	priority_queue<int, vector<int>, greater<int>> pq;
	for(int i = 0; i < m; i++){
		while(itr <= n && range[itr].fi <= k[i]){
			pq.push(range[itr].se);
			itr++;	
		}
		//cout << i << " " << itr << "\n";
		for(int j = 0; j < k[i]; j++){
			while(!pq.empty() && pq.top() < k[i]) pq.pop();
			if(pq.empty()) return 0;
			pq.pop();
		//	cout << pq.top().fi << "\n";
			//if(pq.top() < k[i]) return 0;
			//pq.pop();
		}
	}
	//if(itr <= n || !pq.empty()) return 0;
	return 1;
}

//#define local
#ifdef local
void process(){
	int n;
	cin >> n;
	int a[n], b[n];
	for(int i = 0; i < n; i++) cin >> a[i] >> b[i];
	init(n, a, b);
	int q;
	cin >> q;
	while(q--){
		int m;
		cin >> m;
		int k[m];
		for(int i = 0; i < m; i++) cin >> k[i];
		cout << can(m, k) << "\n";
	}
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) process();
}
#endif

Compilation message

teams.cpp:22:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   22 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
teams.cpp: In function 'int rnd(int, int)':
teams.cpp:27:19: warning: conversion from 'std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::result_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   27 |  int temp = rng() % (r - l + 1);
      |             ~~~~~~^~~~~~~~~~~~~
teams.cpp: In function 'void init(int, int*, int*)':
teams.cpp:34:15: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   34 | void init(int N, int A[], int B[]){
      |           ~~~~^
teams.cpp:20:11: note: shadowed declaration is here
   20 | const int N = 3e5 + 5;
      |           ^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 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 1 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 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 224 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 316 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 1892 KB Output is correct
2 Correct 14 ms 1876 KB Output is correct
3 Correct 25 ms 2528 KB Output is correct
4 Correct 18 ms 2268 KB Output is correct
5 Correct 12 ms 1876 KB Output is correct
6 Correct 13 ms 1892 KB Output is correct
7 Correct 9 ms 1876 KB Output is correct
8 Correct 10 ms 1876 KB Output is correct
9 Correct 10 ms 2640 KB Output is correct
10 Correct 8 ms 2544 KB Output is correct
11 Correct 8 ms 2532 KB Output is correct
12 Correct 9 ms 2528 KB Output is correct
13 Correct 16 ms 2260 KB Output is correct
14 Correct 17 ms 2448 KB Output is correct
15 Correct 14 ms 2000 KB Output is correct
16 Correct 15 ms 2972 KB Output is correct
17 Correct 14 ms 3156 KB Output is correct
18 Correct 15 ms 3156 KB Output is correct

Subtask #3
0 / 43.0

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

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 34 ms 13132 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -