답안 #5746 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
5746	2014-05-15T12:51:46 Z	model_code	Company Planning (TOKI14_company)	C++	100 / 100	184 ms	13188 KB

company

//start of jonathanirvings' template v2.0.0 (BETA)

#define jonathan using
#define ganteng namespace
#define banget std
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <deque>
#include <string>
#include <string.h>
#include <vector>
#include <stack>
#include <queue>
#include <math.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <time.h>
#include <bitset>
#include <list>
jonathan ganteng banget;

typedef long long LL;
typedef pair<int,int> pii;
typedef pair<pii,pii> ppi;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;
typedef vector<string> vstr;
typedef vector<char> vc;

double EPS = 1e-9;
int INF = 2000000000;
long long INFF = 8000000000000000000LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
	#define DEBUG fprintf(stderr,"====TESTING====\n")
	#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
	#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
	#define DEBUG 
	#define VALUE(x)
	#define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORL(a,b,c) for (LL (a)=(b);(a)<=(c);++(a))
#define FORLSQ(a,b,c) for (int (a)=(b);(LL)(a)*(LL)(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define REPD(i,n) FORD(i,n,1)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)
#define READ(n,data) {scanf("%d",&n); REPN(i,n) scanf("%d",&data[i]);}

inline string IntToString(int a){
    char x[100];
    sprintf(x,"%d",a); string s = x;
    return s;
}

inline int StringToInt(string a){
    char x[100]; int res;
    strcpy(x,a.c_str()); sscanf(x,"%d",&res);
    return res;
}

inline string GetString(void){
	char x[1000005];
	scanf("%s",x); string s = x;
	return s;
}

inline string uppercase(string s){
	int n = SIZE(s); 
	REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
	return s;
}

inline string lowercase(string s){
	int n = SIZE(s); 
	REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
	return s;
}

inline void OPEN (string s) {
    freopen ((s + ".in").c_str (), "r", stdin);
    freopen ((s + ".out").c_str (), "w", stdout);
}

//end of jonathanirvings' template v2.0.0 (BETA)

int n,m;
int parent[100005];
vi child[100005];
int dp[100005];
int risan;
priority_queue<int> pq;

inline void dfs(int now,int take)
{
	int sz = SIZE(child[now]);
	dp[now] = 1;
	REP(i,sz) dfs(child[now][i],take);
	while (!pq.empty()) pq.pop();
	REP(i,sz) pq.push(dp[child[now][i]]);
	REP(i,take) 
	{
		if (pq.empty()) break;
		dp[now] += pq.top();
		pq.pop();
	}
}

bool bisa(int x)
{
	dfs(0,x);
	return (dp[0] >= m);
}

int main()
{
	scanf("%d %d",&n,&m);
	FOR(i,1,n)
	{
		scanf("%d",&parent[i]);
		--parent[i];
		child[parent[i]].pb(i);
	}
	int L = 0, R = n, risan = -1;
	while (L <= R)
	{
		int M = (L + R) >> 1;
		if (bisa(M))
		{
			risan = M;
			R = M - 1;
		} else L = M + 1;
	}
	printf("%d\n",risan);
	return 0;
}

Subtask #1
12.0 / 12.0

#	결과	메모리	Grader output
1	Correct	4804 KB	Output is correct
2	Correct	4804 KB	Output is correct
3	Correct	4804 KB	Output is correct
4	Correct	4804 KB	Output is correct
5	Correct	4804 KB	Output is correct
6	Correct	4804 KB	Output is correct
7	Correct	4804 KB	Output is correct
8	Correct	4804 KB	Output is correct
9	Correct	4804 KB	Output is correct
10	Correct	4804 KB	Output is correct
11	Correct	4804 KB	Output is correct
12	Correct	4804 KB	Output is correct
13	Correct	4804 KB	Output is correct
14	Correct	4804 KB	Output is correct
15	Correct	4804 KB	Output is correct
16	Correct	4804 KB	Output is correct
17	Correct	4804 KB	Output is correct
18	Correct	4804 KB	Output is correct
19	Correct	4804 KB	Output is correct
20	Correct	4804 KB	Output is correct
21	Correct	4804 KB	Output is correct
22	Correct	4804 KB	Output is correct
23	Correct	4804 KB	Output is correct
24	Correct	4804 KB	Output is correct
25	Correct	4804 KB	Output is correct
26	Correct	4804 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	메모리	Grader output
1	Correct	4804 KB	Output is correct
2	Correct	4804 KB	Output is correct
3	Correct	4804 KB	Output is correct
4	Correct	4804 KB	Output is correct
5	Correct	4804 KB	Output is correct
6	Correct	4804 KB	Output is correct
7	Correct	4804 KB	Output is correct
8	Correct	4804 KB	Output is correct
9	Correct	4804 KB	Output is correct
10	Correct	4804 KB	Output is correct
11	Correct	4804 KB	Output is correct
12	Correct	4804 KB	Output is correct
13	Correct	4804 KB	Output is correct
14	Correct	4804 KB	Output is correct
15	Correct	4804 KB	Output is correct
16	Correct	4804 KB	Output is correct
17	Correct	4804 KB	Output is correct
18	Correct	4804 KB	Output is correct
19	Correct	4804 KB	Output is correct
20	Correct	4804 KB	Output is correct
21	Correct	4804 KB	Output is correct
22	Correct	4804 KB	Output is correct
23	Correct	4804 KB	Output is correct
24	Correct	4804 KB	Output is correct
25	Correct	4804 KB	Output is correct
26	Correct	4804 KB	Output is correct
27	Correct	4804 KB	Output is correct
28	Correct	4804 KB	Output is correct
29	Correct	4804 KB	Output is correct
30	Correct	4804 KB	Output is correct
31	Correct	4804 KB	Output is correct
32	Correct	4804 KB	Output is correct
33	Correct	4804 KB	Output is correct
34	Correct	4804 KB	Output is correct
35	Correct	4804 KB	Output is correct
36	Correct	4804 KB	Output is correct
37	Correct	4804 KB	Output is correct

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	4804 KB	Output is correct
2	Correct	176 ms	6784 KB	Output is correct
3	Correct	64 ms	6256 KB	Output is correct
4	Correct	64 ms	6256 KB	Output is correct
5	Correct	172 ms	6784 KB	Output is correct
6	Correct	144 ms	6520 KB	Output is correct
7	Correct	140 ms	6520 KB	Output is correct
8	Correct	132 ms	6388 KB	Output is correct
9	Correct	140 ms	6520 KB	Output is correct
10	Correct	120 ms	6256 KB	Output is correct
11	Correct	148 ms	6388 KB	Output is correct
12	Correct	184 ms	6652 KB	Output is correct
13	Correct	148 ms	6652 KB	Output is correct
14	Correct	88 ms	5992 KB	Output is correct
15	Correct	152 ms	6652 KB	Output is correct
16	Correct	92 ms	5992 KB	Output is correct
17	Correct	124 ms	6388 KB	Output is correct
18	Correct	60 ms	5728 KB	Output is correct
19	Correct	20 ms	5332 KB	Output is correct
20	Correct	52 ms	5992 KB	Output is correct
21	Correct	36 ms	5728 KB	Output is correct
22	Correct	12 ms	5200 KB	Output is correct
23	Correct	48 ms	5992 KB	Output is correct
24	Correct	56 ms	6124 KB	Output is correct
25	Correct	0 ms	4804 KB	Output is correct

Subtask #4
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	4804 KB	Output is correct
2	Correct	100 ms	5512 KB	Output is correct
3	Correct	96 ms	6344 KB	Output is correct
4	Correct	88 ms	6388 KB	Output is correct
5	Correct	88 ms	7708 KB	Output is correct
6	Correct	68 ms	6256 KB	Output is correct
7	Correct	80 ms	13188 KB	Output is correct
8	Correct	172 ms	6520 KB	Output is correct
9	Correct	184 ms	6520 KB	Output is correct
10	Correct	124 ms	6124 KB	Output is correct
11	Correct	48 ms	5332 KB	Output is correct
12	Correct	148 ms	6256 KB	Output is correct
13	Correct	100 ms	5860 KB	Output is correct
14	Correct	144 ms	6256 KB	Output is correct
15	Correct	164 ms	6520 KB	Output is correct
16	Correct	72 ms	5596 KB	Output is correct
17	Correct	60 ms	5596 KB	Output is correct
18	Correct	108 ms	6124 KB	Output is correct
19	Correct	124 ms	6124 KB	Output is correct
20	Correct	52 ms	5464 KB	Output is correct
21	Correct	32 ms	5200 KB	Output is correct
22	Correct	36 ms	8400 KB	Output is correct
23	Correct	48 ms	9856 KB	Output is correct
24	Correct	44 ms	9792 KB	Output is correct
25	Correct	32 ms	6256 KB	Output is correct
26	Correct	72 ms	7312 KB	Output is correct
27	Correct	68 ms	6256 KB	Output is correct
28	Correct	44 ms	5728 KB	Output is correct
29	Correct	56 ms	6124 KB	Output is correct
30	Correct	68 ms	5992 KB	Output is correct
31	Correct	68 ms	5992 KB	Output is correct
32	Correct	24 ms	5200 KB	Output is correct
33	Correct	32 ms	5576 KB	Output is correct
34	Correct	40 ms	5148 KB	Output is correct
35	Correct	4 ms	4804 KB	Output is correct

Subtask #5
43.0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	4804 KB	Output is correct
2	Correct	92 ms	5588 KB	Output is correct
3	Correct	100 ms	6344 KB	Output is correct
4	Correct	72 ms	6388 KB	Output is correct
5	Correct	88 ms	7708 KB	Output is correct
6	Correct	68 ms	6256 KB	Output is correct
7	Correct	92 ms	13184 KB	Output is correct
8	Correct	164 ms	6520 KB	Output is correct
9	Correct	100 ms	5776 KB	Output is correct
10	Correct	96 ms	6344 KB	Output is correct
11	Correct	92 ms	6388 KB	Output is correct
12	Correct	88 ms	7708 KB	Output is correct
13	Correct	64 ms	6256 KB	Output is correct
14	Correct	80 ms	13184 KB	Output is correct
15	Correct	172 ms	6520 KB	Output is correct
16	Correct	176 ms	6520 KB	Output is correct
17	Correct	168 ms	6520 KB	Output is correct
18	Correct	156 ms	6388 KB	Output is correct
19	Correct	120 ms	6124 KB	Output is correct
20	Correct	108 ms	5992 KB	Output is correct
21	Correct	112 ms	6124 KB	Output is correct
22	Correct	28 ms	5200 KB	Output is correct
23	Correct	108 ms	5992 KB	Output is correct
24	Correct	44 ms	5332 KB	Output is correct
25	Correct	64 ms	5596 KB	Output is correct
26	Correct	64 ms	5596 KB	Output is correct
27	Correct	144 ms	6256 KB	Output is correct
28	Correct	152 ms	6388 KB	Output is correct
29	Correct	148 ms	6388 KB	Output is correct
30	Correct	12 ms	4936 KB	Output is correct
31	Correct	28 ms	5068 KB	Output is correct
32	Correct	164 ms	6388 KB	Output is correct
33	Correct	152 ms	6256 KB	Output is correct
34	Correct	28 ms	5200 KB	Output is correct
35	Correct	164 ms	6388 KB	Output is correct
36	Correct	168 ms	6388 KB	Output is correct
37	Correct	124 ms	6124 KB	Output is correct
38	Correct	112 ms	5992 KB	Output is correct
39	Correct	164 ms	6388 KB	Output is correct
40	Correct	12 ms	4936 KB	Output is correct
41	Correct	56 ms	5464 KB	Output is correct
42	Correct	60 ms	11732 KB	Output is correct
43	Correct	28 ms	8040 KB	Output is correct
44	Correct	48 ms	9972 KB	Output is correct
45	Correct	72 ms	7312 KB	Output is correct
46	Correct	16 ms	5464 KB	Output is correct
47	Correct	52 ms	10304 KB	Output is correct
48	Correct	64 ms	11968 KB	Output is correct
49	Correct	76 ms	12872 KB	Output is correct
50	Correct	76 ms	7444 KB	Output is correct
51	Correct	40 ms	6256 KB	Output is correct
52	Correct	48 ms	5860 KB	Output is correct
53	Correct	48 ms	5992 KB	Output is correct
54	Correct	20 ms	5464 KB	Output is correct
55	Correct	60 ms	5992 KB	Output is correct
56	Correct	48 ms	5596 KB	Output is correct
57	Correct	128 ms	6388 KB	Output is correct
58	Correct	28 ms	5464 KB	Output is correct
59	Correct	28 ms	5596 KB	Output is correct
60	Correct	56 ms	5992 KB	Output is correct
61	Correct	28 ms	5332 KB	Output is correct
62	Correct	48 ms	5728 KB	Output is correct
63	Correct	60 ms	5728 KB	Output is correct
64	Correct	84 ms	6344 KB	Output is correct
65	Correct	88 ms	6344 KB	Output is correct
66	Correct	48 ms	5268 KB	Output is correct
67	Correct	44 ms	5284 KB	Output is correct
68	Correct	68 ms	5448 KB	Output is correct
69	Correct	32 ms	5124 KB	Output is correct
70	Correct	76 ms	5676 KB	Output is correct
71	Correct	40 ms	5260 KB	Output is correct
72	Correct	0 ms	4804 KB	Output is correct

답안 #5746

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 20.0 / 20.0

Subtask #3 18.0 / 18.0

Subtask #4 7.0 / 7.0

Subtask #5 43.0 / 43.0

Subtask #1
12.0 / 12.0

Subtask #2
20.0 / 20.0

Subtask #3
18.0 / 18.0

Subtask #4
7.0 / 7.0

Subtask #5
43.0 / 43.0