# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
820159 |
2023-08-10T21:33:04 Z |
tolbi |
팀들 (IOI15_teams) |
C++17 |
|
4000 ms |
20088 KB |
#pragma optimize("Bismillahirrahmanirrahim");
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream& operator>>(istream& is, vector<T> &v){for (auto &it : v) is>>it;return is;}
template<typename T, size_t Y> istream& operator>>(istream& is, array<T,Y> &v){for (auto &it : v) is>>it;return is;}
template<typename T> ostream& operator<<(ostream& os, vector<T> &v){for (auto &it : v) os<<it<<" ";return os;}
template<typename T, size_t Y> ostream& operator<<(ostream& os, array<T,Y> &v){for (auto &it : v) os<<it<<" ";return os;}
template<typename X, typename Y> istream& operator>>(istream& is, pair<X,Y> &pr){return is<<pr.first<<" "<<pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> &pr){return os>>pr.first>>pr.second;}
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define vint(x) vector<int> x
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define endl '\n'
#define tol(bi) (1LL<<((int)(bi)))
typedef long long ll;
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "teams.h"
vector<pair<int,int>> arr;
void init(int N, int A[], int B[]) {
arr.resize(N);
for (int i = 0; i < N; i++){
arr.push_back({A[i],B[i]});
}
sortarr(arr);
}
int can(int m, int k[]) {
sort(k, k+m);
priority_queue<int,vector<int>,greater<int>> pq;
int indi = 0;
for (int i = 0; i < m; i++){
while (indi<arr.size() && arr[indi].first<=k[i]){
pq.push(arr[indi++].second);
}
while (pq.size() && pq.top()<k[i]) pq.pop();
if (pq.size()<k[i]) return 0;
for (int j = 0; j < k[i]; j++){
pq.pop();
}
}
return 1;
}
Compilation message
teams.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
1 | #pragma optimize("Bismillahirrahmanirrahim");
|
teams.cpp: In function 'int can(int, int*)':
teams.cpp:48:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
48 | while (indi<arr.size() && arr[indi].first<=k[i]){
| ~~~~^~~~~~~~~~~
teams.cpp:52:16: 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]
52 | if (pq.size()<k[i]) return 0;
| ~~~~~~~~~^~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 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 |
340 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 |
308 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |
21 |
Correct |
1 ms |
308 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 |
308 KB |
Output is correct |
26 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
3524 KB |
Output is correct |
2 |
Correct |
17 ms |
3516 KB |
Output is correct |
3 |
Correct |
27 ms |
4332 KB |
Output is correct |
4 |
Correct |
19 ms |
3908 KB |
Output is correct |
5 |
Correct |
15 ms |
3524 KB |
Output is correct |
6 |
Correct |
16 ms |
3560 KB |
Output is correct |
7 |
Correct |
14 ms |
3524 KB |
Output is correct |
8 |
Correct |
15 ms |
3524 KB |
Output is correct |
9 |
Correct |
20 ms |
4592 KB |
Output is correct |
10 |
Correct |
15 ms |
4504 KB |
Output is correct |
11 |
Correct |
17 ms |
4488 KB |
Output is correct |
12 |
Correct |
16 ms |
4440 KB |
Output is correct |
13 |
Correct |
21 ms |
4208 KB |
Output is correct |
14 |
Correct |
21 ms |
4420 KB |
Output is correct |
15 |
Correct |
18 ms |
3560 KB |
Output is correct |
16 |
Correct |
17 ms |
3524 KB |
Output is correct |
17 |
Correct |
17 ms |
3524 KB |
Output is correct |
18 |
Correct |
18 ms |
3568 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
477 ms |
4072 KB |
Output is correct |
2 |
Correct |
528 ms |
3996 KB |
Output is correct |
3 |
Execution timed out |
4042 ms |
4748 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2974 ms |
16944 KB |
Output is correct |
2 |
Correct |
3409 ms |
16964 KB |
Output is correct |
3 |
Execution timed out |
4065 ms |
20088 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |