oj.uz

Submission #1029462

# Submission time Handle Problem Language Result Execution time Memory
1029462 2024-07-20T22:53:25 Z Dan4Life Teams (IOI15_teams) C++17
77 / 100
 4000 ms 171600 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ar2 = array<int,2>;
const int mxN = (int)5e5+10;
const int mxM = (int)2e5+10;
ar2 v[mxN]; int n;
multiset<int> S;
const int B = sqrt(mxM);
const int mxLg = __lg(mxN)+1;
const int mxSeg = mxN*4*mxLg;
int a[mxN], b[mxN];
int seg[mxSeg], L[mxSeg], R[mxSeg], root[mxSeg];
int segNodes = 1;

int newChild(int p, int v){
	int np = ++segNodes;
	seg[np] = seg[p]+v;
	L[np]=R[np]=0;
	return np;
}

int newParent(int lp, int rp){
	int np = ++segNodes;
	L[np] = lp; R[np] = rp;
	seg[np] = seg[lp]+seg[rp];
	return np;
}

int upd(int x, int v, int p, int l=1, int r=n){
	if(!p) return p;
	if(l==r) return newChild(p,v);
	int mid = (l+r)/2;
	if(!L[p]) L[p]=++segNodes;
	if(!R[p]) R[p]=++segNodes;
	if(x<=mid) return newParent(upd(x,v,L[p],l,mid),R[p]);
	else return newParent(L[p],upd(x,v,R[p],mid+1,r));
}

int query(int i, int j, int p, int l=1, int r=n){
	if(!p or i>r or j<l or i>j) return 0;
	if(i<=l and r<=j) return seg[p];
	int mid = (l+r)/2;
	return query(i,j,L[p],l,mid)+query(i,j,R[p],mid+1,r);
}

void init(int N, int A[], int B[]) {
	n = N;
	for(int i = 0; i < n; i++) a[i]=A[i],b[i]=B[i];
	for(int i = 0; i < n; i++) v[i]={a[i],b[i]};
    sort(v,v+n,[&](ar2 x, ar2 y){ return x[1]>y[1]; }); 
    int j = 0;
    root[n+1] = 1;
    for(int i = n; i>=1; i--){
		root[i] = root[i+1];
		while(j<n and v[j][1]==i)
			root[i]=upd(v[j][0],1,root[i]), j++;
	}
}

int dp[B+10];
int can(int m, int a[]) {
	sort(a,a+m); 
	if(m>=B){
		reverse(a,a+m);
		int j = 0; S.clear();
		for(int i = 0; i < m; i++){
			int x = a[i];
			while(j<n and v[j][1]>=a[i]) 
				S.insert(v[j][0]), j++;
			while(x--){
				auto itr = S.upper_bound(a[i]);
				if(itr==begin(S)) return 0;
				S.erase(--itr);
			}
		}
		return 1;
	}
	for(int i = 0; i < m; i++){
		dp[i] = query(1,a[i],root[a[i]]);
		for(int j = 0; j < i; j++)
			dp[i] = min(dp[i], dp[j]+query(a[j]+1,a[i],root[a[i]]));
		dp[i]-=a[i];
		if(dp[i]<0) return 0;
	}
	return 1;
}

Compilation message

teams.cpp:11:19: warning: conversion from 'double' to 'int' changes value from '4.4722477570009471e+2' to '447' [-Wfloat-conversion]
   11 | const int B = sqrt(mxM);
      |               ~~~~^~~~~
teams.cpp: In function 'int newChild(int, int)':
teams.cpp:18:25: warning: declaration of 'v' shadows a global declaration [-Wshadow]
   18 | int newChild(int p, int v){
      |                     ~~~~^
teams.cpp:9:5: note: shadowed declaration is here
    9 | ar2 v[mxN]; int n;
      |     ^
teams.cpp: In function 'int upd(int, int, int, int, int)':
teams.cpp:32:20: warning: declaration of 'v' shadows a global declaration [-Wshadow]
   32 | int upd(int x, int v, int p, int l=1, int r=n){
      |                ~~~~^
teams.cpp:9:5: note: shadowed declaration is here
    9 | ar2 v[mxN]; int n;
      |     ^
teams.cpp: In function 'void init(int, int*, int*)':
teams.cpp:49:31: warning: declaration of 'B' shadows a global declaration [-Wshadow]
   49 | void init(int N, int A[], int B[]) {
      |                           ~~~~^~~
teams.cpp:11:11: note: shadowed declaration is here
   11 | const int B = sqrt(mxM);
      |           ^
teams.cpp: In function 'int can(int, int*)':
teams.cpp:64:20: warning: declaration of 'a' shadows a global declaration [-Wshadow]
   64 | int can(int m, int a[]) {
      |                ~~~~^~~
teams.cpp:14:5: note: shadowed declaration is here
   14 | int a[mxN], b[mxN];
      |     ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 43 ms 26964 KB Output is correct
2 Correct 43 ms 26960 KB Output is correct
3 Correct 45 ms 26964 KB Output is correct
4 Correct 66 ms 32308 KB Output is correct
5 Correct 42 ms 24656 KB Output is correct
6 Correct 26 ms 24668 KB Output is correct
7 Correct 23 ms 24668 KB Output is correct
8 Correct 24 ms 24664 KB Output is correct
9 Correct 37 ms 30036 KB Output is correct
10 Correct 32 ms 29524 KB Output is correct
11 Correct 40 ms 29648 KB Output is correct
12 Correct 22 ms 24920 KB Output is correct
13 Correct 31 ms 25140 KB Output is correct
14 Correct 29 ms 26192 KB Output is correct
15 Correct 38 ms 26704 KB Output is correct
16 Correct 38 ms 26764 KB Output is correct
17 Correct 25 ms 25496 KB Output is correct
18 Correct 25 ms 25688 KB Output is correct

Subtask #3
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 27732 KB Output is correct
2 Correct 46 ms 27728 KB Output is correct
3 Correct 87 ms 31212 KB Output is correct
4 Correct 68 ms 32340 KB Output is correct
5 Correct 2395 ms 25504 KB Output is correct
6 Correct 1598 ms 25556 KB Output is correct
7 Correct 28 ms 25428 KB Output is correct
8 Correct 1212 ms 25508 KB Output is correct
9 Correct 35 ms 30036 KB Output is correct
10 Correct 78 ms 30036 KB Output is correct
11 Correct 507 ms 30292 KB Output is correct
12 Correct 1057 ms 26032 KB Output is correct
13 Correct 195 ms 26196 KB Output is correct
14 Correct 92 ms 29452 KB Output is correct
15 Correct 97 ms 27732 KB Output is correct
16 Correct 106 ms 27732 KB Output is correct
17 Correct 194 ms 26452 KB Output is correct
18 Correct 210 ms 26452 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4094 ms 171600 KB Time limit exceeded
2 Halted 0 ms 0 KB -