oj.uz

Submission #384554

# Submission time Handle Problem Language Result Execution time Memory
384554 2021-04-01T20:44:57 Z luciocf Teams (IOI15_teams) C++11
77 / 100
 3547 ms 68716 KB 
#include <bits/stdc++.h>
#include "teams.h"

#define ff first
#define ss second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;

const int maxn = 1e5+10;

int n;
pii range[maxn];

int ind[maxn];

struct Node
{
	Node *l, *r;
	int v;

	Node()
	{
		l = r = NULL;
		v = 0;
	}
} *version[maxn];

struct PersistentSegmentTree
{
	void build(Node *node, int l, int r)
	{
		if (l == r) return;

		int mid = (l+r)>>1;

		node->l = new Node(); node->r = new Node();

		build(node->l, l, mid); build(node->r, mid+1, r);
	}

	void upd(Node *prev, Node *node, int l, int r, int pos, int v)
	{
		if (l == r)
		{
			node->v = prev->v + v;
			return;
		}

		int mid = (l+r)>>1;

		if (pos <= mid)
		{
			if (!node->l) node->l = new Node();
			node->r = prev->r;

			upd(prev->l, node->l, l, mid, pos, v);
		}
		else
		{
			if (!node->r) node->r = new Node();
			node->l = prev->l;

			upd(prev->r, node->r, mid+1, r, pos, v);
		}

		node->v = node->l->v + node->r->v;
	}

	int query(Node *prev, Node *node, int l, int r, int a, int b)
	{
		if (l > b || r < a) return 0;
		if (l >= a && r <= b) return node->v - prev->v;

		int mid = (l+r)>>1;

		return query(prev->l, node->l, l, mid, a, b) + query(prev->r, node->r, mid+1, r, a, b);
	}

	int get(int l, int r, int k)
	{
		return query(version[ind[l]], version[ind[r]], 1, n, k, n);
	}
} seg;

void init(int N, int A[], int B[])
{
	n = N;
	for (int i = 1; i <= n; i++)
		range[i] = {A[i-1], B[i-1]};

	sort(range+1, range+n+1);

	int ptr = 1, aux = 0;

	version[0] = new Node();
	seg.build(version[0], 1, n);

	for (int i = 1; i <= n; i++)
	{
		while (ptr <= n && range[ptr].ff == i)
		{
			version[++aux] = new Node();
			seg.upd(version[aux-1], version[aux], 1, n, range[ptr].ss, 1);
			ptr++;
		}

		ind[i] = aux;
	}
}

ll dp[maxn];
int fq[maxn];

int can(int M, int K[])
{
	int m = M;

	vector<int> V;

	for (int i = 0; i < m; i++)
	{
		V.push_back(K[i]);
		fq[K[i]]++;
	}

	sort(V.begin(), V.end());
	V.erase(unique(V.begin(), V.end()), V.end());

	m = V.size();

	for (int i = 0; i < m; i++)
	{
		int k = V[i];
		dp[i] = 1ll*seg.get(0, k, k) - 1ll*fq[k]*k;

		for (int j = 0; j < i; j++)
			dp[i] = min(dp[i], dp[j] + seg.get(V[j], k, k) - 1ll*fq[k]*k);

		if (dp[i] < 0)
		{
			for (int j = 0; j < m; j++)
				dp[j] = fq[V[j]] = 0;
			return 0;
		}
	}

	for (int j = 0; j < m; j++)
		dp[j] = fq[V[j]] = 0;

	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:132:12: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
  132 |  m = V.size();
      |      ~~~~~~^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 64748 KB Output is correct
2 Correct 153 ms 64876 KB Output is correct
3 Correct 163 ms 64748 KB Output is correct
4 Correct 154 ms 65768 KB Output is correct
5 Correct 122 ms 64748 KB Output is correct
6 Correct 110 ms 64748 KB Output is correct
7 Correct 107 ms 64748 KB Output is correct
8 Correct 107 ms 64748 KB Output is correct
9 Correct 105 ms 63084 KB Output is correct
10 Correct 99 ms 62828 KB Output is correct
11 Correct 111 ms 65772 KB Output is correct
12 Correct 103 ms 62572 KB Output is correct
13 Correct 111 ms 65516 KB Output is correct
14 Correct 110 ms 63340 KB Output is correct
15 Correct 145 ms 64748 KB Output is correct
16 Correct 145 ms 64748 KB Output is correct
17 Correct 112 ms 65772 KB Output is correct
18 Correct 110 ms 65772 KB Output is correct

Subtask #3
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 65152 KB Output is correct
2 Correct 164 ms 65132 KB Output is correct
3 Correct 279 ms 68460 KB Output is correct
4 Correct 159 ms 65768 KB Output is correct
5 Correct 3547 ms 65460 KB Output is correct
6 Correct 2554 ms 65392 KB Output is correct
7 Correct 118 ms 65132 KB Output is correct
8 Correct 1973 ms 66532 KB Output is correct
9 Correct 98 ms 63932 KB Output is correct
10 Correct 104 ms 63816 KB Output is correct
11 Correct 150 ms 67072 KB Output is correct
12 Correct 1409 ms 64160 KB Output is correct
13 Correct 403 ms 67692 KB Output is correct
14 Correct 315 ms 68716 KB Output is correct
15 Correct 229 ms 66796 KB Output is correct
16 Correct 215 ms 66720 KB Output is correct
17 Correct 224 ms 67692 KB Output is correct
18 Correct 193 ms 67564 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 38 ms 10220 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -