oj.uz

답안 #960018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960018 2024-04-09T13:37:25 Z 8pete8 팀들 (IOI15_teams) C++17
34 / 100
 4000 ms 9168 KB 
#include "teams.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
using namespace std;
//#define double long double
vector<pii>v;
int n;
bool cmp(pii a,pii b){
	if(a.s==b.s)return a.f>b.f;
	return a.s<b.s;
}
void init(int N, int A[], int B[]){
	n=N;
	for(int i=0;i<n;i++)v.pb({A[i],B[i]});
	sort(all(v),cmp);
}
int can(int m, int k[]){
	multiset<pii>st;
	for(int i=0;i<m;i++)st.insert({k[i],k[i]});
	for(int i=0;i<n;i++){
		auto it=st.lb({v[i].f,0});
		if(it==st.end())continue;
		pii a=(*it);
		st.erase(it);
		if(v[i].s>=(*it).f)a.s--;
		if(a.s)st.insert(a);
	}
	return st.empty();
}/*
int32_t main(){
	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';
	}
}
*/
/*
we can greedy?
sort all pair(a,b) by b
then for each k 1->m
we can find the first k[i] range that cover k[i]
we can keep doing this?
this will be (s*n) where each m in each qry can be at most n

if this work->we can do sqrt decomp?
*/

Subtask #1
21.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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 440 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 2260 KB Output is correct
2 Correct 15 ms 2256 KB Output is correct
3 Correct 17 ms 2256 KB Output is correct
4 Correct 36 ms 8252 KB Output is correct
5 Correct 15 ms 3028 KB Output is correct
6 Correct 16 ms 2996 KB Output is correct
7 Correct 15 ms 3028 KB Output is correct
8 Correct 16 ms 3028 KB Output is correct
9 Correct 20 ms 4828 KB Output is correct
10 Correct 14 ms 3280 KB Output is correct
11 Correct 12 ms 2772 KB Output is correct
12 Correct 12 ms 2888 KB Output is correct
13 Correct 17 ms 3284 KB Output is correct
14 Correct 16 ms 3284 KB Output is correct
15 Correct 15 ms 3284 KB Output is correct
16 Correct 15 ms 3404 KB Output is correct
17 Correct 15 ms 3284 KB Output is correct
18 Correct 15 ms 3532 KB Output is correct

Subtask #3
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 2260 KB Output is correct
2 Correct 191 ms 2396 KB Output is correct
3 Execution timed out 4006 ms 2256 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 716 ms 8932 KB Output is correct
2 Correct 816 ms 9168 KB Output is correct
3 Execution timed out 4041 ms 8652 KB Time limit exceeded
4 Halted 0 ms 0 KB -