Submission #57697

#	Time	Username	Problem	Language	Result	Execution time	Memory
57697		qkxwsm	Teams (IOI15_teams)	C++17	0 / 100	4051 ms	11700 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>

using namespace std;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long randomize(long long mod)
{
	return ((1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}

#define MP make_pair
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-20;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 500013

long long normalize(long long x, long long mod = INF)
{
	return (((x % mod) + mod) % mod);
}

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int N, M;
pii want[MAXN];
int arr[MAXN];

void init(int n, int A[], int B[])
{
	N = n;
	for (int i = 0; i < N; i++)
	{
		want[i] = MP(A[i], B[i]);
	}
	sort(want, want + N);
}

int can(int m, int k[])
{
	M = m;
	for (int i = 0; i < M; i++)
	{
		arr[i] = k[i];
	}
	sort(arr, arr + M);
	//for this subset, how many distinct people have it as a subset?
	for (int i = 0; i < M; i++)
	{
		int sum = 0;
		for (int j = i; j < M; j++)
		{
			sum += arr[j];
			int cur = 0;
			//how many guys are bad...
			for (int k = 0; k < N; k++)
			{
				bool flag = false;
				for (int m = i; m <= j; m++)
				{
					if (want[k].fi <= arr[m] && arr[m] <= want[k].se)
					{
						flag = true;
					}
				}
				if (flag)
				{
					cur++;
				}
			}
			if (cur < sum)
			{
				return 0;
			}
		}

	}
	return 1;
	//check if the sum of values in subset of arr's is < sum cnt's of those arr's
	//you need to make a team if
}

Compilation message (stderr)

teams.cpp: In function 'int can(int, int*)':
teams.cpp:136:13: warning: declaration of 'int k' shadows a parameter [-Wshadow]
    for (int k = 0; k < N; k++)
             ^
teams.cpp:119:22: note: shadowed declaration is here
 int can(int m, int k[])
                      ^
teams.cpp:139:14: warning: declaration of 'int m' shadows a parameter [-Wshadow]
     for (int m = i; m <= j; m++)
              ^
teams.cpp:119:13: note: shadowed declaration is here
 int can(int m, int k[])
             ^

• Subtask 1: 0 / 21
• Subtask 2: 0 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23