oj.uz

Submission #1057699

# Submission time Handle Problem Language Result Execution time Memory
1057699 2024-08-14T03:43:14 Z MuhammadSaram Teams (IOI15_teams) C++17
0 / 100
 2697 ms 110528 KB 
#include <bits/stdc++.h>
#include "teams.h"
 
using namespace std;
 
const int M = 5e5 + 1;
 
#define all(v) v.begin(), v.end()
 
int n,pre[M];
vector<int> V,seg[M*2];
 
void make(int v=0,int s=0,int e=n)
{
	for (int i=s;i<e;i++)
		seg[v].push_back(V[i]);
	sort(all(seg[v]));
	if (s+1==e)
		return;
	int mid=(s+e)/2,lc=v+1,rc=v+(mid-s)*2;
	make(lc,s,mid);
	make(rc,mid,e);
}
 
int get(int l,int r,int x,int v=0,int s=0,int e=n)
{
	if (l>=e or r<=s)
		return 0;
	if (l<=s && e<=r)
	{
		int y=upper_bound(all(seg[v]),x)-begin(seg[v]);
		return y;
	}
	int mid=(s+e)/2,lc=v+1,rc=v+(mid-s)*2;
	return get(l,r,x,lc,s,mid)+get(l,r,x,rc,mid,e);
}
 
void init(int N,int A[],int B[])
{
	n=N;
	vector<pair<int,int>> v1;
	for (int i=0;i<n;i++)
		v1.push_back({B[i],A[i]}),pre[B[i]]++;
	sort(v1.begin(),v1.end());
	for (auto i:v1)
		V.push_back(i.second);
	for (int i=1;i<M;i++)
		pre[i]+=pre[i-1];
	make();
}
 
int can(int m,int k[])
{
	sort(k,k+m);
	int val=0;
	for (int i=0;i<m;i++)
	{
		int s=pre[k[i]-1],e=n;
		while (s+1<e)
		{
			int mid=(s+e)/2;
			if (get(pre[k[i]-1],mid,k[i])>=val+k[i])
				e=mid;
			else
				s=mid;
		}
		if (get(pre[k[i]-1],e,k[i])<val+k[i])
			return 0;
		if (i!=m-1)
			val=get(pre[k[i+1]-1],e,k[i]);
	}
	return 1;
}

Compilation message

teams.cpp: In function 'int get(int, int, int, int, int, int)':
teams.cpp:31:35: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   31 |   int y=upper_bound(all(seg[v]),x)-begin(seg[v]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 25692 KB Output is correct
2 Correct 3 ms 25692 KB Output is correct
3 Correct 3 ms 25692 KB Output is correct
4 Correct 4 ms 25692 KB Output is correct
5 Correct 3 ms 25736 KB Output is correct
6 Correct 3 ms 25692 KB Output is correct
7 Correct 4 ms 25692 KB Output is correct
8 Correct 4 ms 25736 KB Output is correct
9 Incorrect 4 ms 25688 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 40904 KB Output is correct
2 Correct 74 ms 40904 KB Output is correct
3 Correct 75 ms 40788 KB Output is correct
4 Correct 76 ms 40900 KB Output is correct
5 Correct 38 ms 40908 KB Output is correct
6 Correct 37 ms 40788 KB Output is correct
7 Incorrect 39 ms 40904 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 40968 KB Output is correct
2 Correct 82 ms 40900 KB Output is correct
3 Correct 737 ms 43440 KB Output is correct
4 Correct 76 ms 40896 KB Output is correct
5 Correct 368 ms 40756 KB Output is correct
6 Correct 349 ms 40908 KB Output is correct
7 Incorrect 381 ms 40904 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 429 ms 99768 KB Output is correct
2 Correct 434 ms 106320 KB Output is correct
3 Correct 2697 ms 110528 KB Output is correct
4 Correct 424 ms 106432 KB Output is correct
5 Correct 1032 ms 103612 KB Output is correct
6 Correct 943 ms 103608 KB Output is correct
7 Incorrect 1030 ms 103432 KB Output isn't correct
8 Halted 0 ms 0 KB -