AtCoder Grand Contest 009

Submission #1074448

Source codeソースコード

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

vector<vector<int> > b;

int get_depth(int x) {
  int sz = (int)b[x].size();
  if (sz == 0) {
    return 0;
  }

  vector<int> ret(sz);
  rep (i, sz) {
    ret[i] = get_depth(b[x][i]);
  }
  sort(all(ret), std::greater<int>());
  rep (i, sz) {
    ret[i] += (i+1);
  }
  sort(all(ret), std::greater<int>());
  return ret[0];
}

int main() {
  int n;
  scanf("%d", &n);
  vi a(n+1, 0);
  b.resize(n+1);
  FOR (i, 2, n+1) {
    scanf("%d", &a[i]);
    b[a[i]].push_back(i);
  }

  int ans = get_depth(1);
  printf("%d\n", ans);
  return 0;
}

Submission

Task問題 B - Tournament
User nameユーザ名 mu
Created time投稿日時
Language言語 C++14 (Clang 3.8.0)
Status状態 AC
Score得点 800
Source lengthソースコード長 1471 Byte
File nameファイル名
Exec time実行時間 43 ms
Memory usageメモリ使用量 18560 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - s1.txt,s2.txt,s3.txt
All 800 / 800 01.txt,02.txt,03.txt,04.txt,05.txt,06.txt,07.txt,08.txt,09.txt,10.txt,11.txt,12.txt,13.txt,14.txt,15.txt,16.txt,17.txt,18.txt,19.txt,20.txt,21.txt,22.txt,23.txt,24.txt,25.txt,26.txt,27.txt,28.txt,29.txt,30.txt,31.txt,32.txt,33.txt,34.txt,35.txt,36.txt,37.txt,38.txt,39.txt,40.txt,41.txt,42.txt,43.txt,44.txt,45.txt,46.txt,47.txt,48.txt,49.txt,50.txt,s1.txt,s2.txt,s3.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01.txt AC 30 ms 4608 KB
02.txt AC 30 ms 4608 KB
03.txt AC 30 ms 4608 KB
04.txt AC 30 ms 4608 KB
05.txt AC 30 ms 4608 KB
06.txt AC 30 ms 4608 KB
07.txt AC 30 ms 4736 KB
08.txt AC 30 ms 4608 KB
09.txt AC 30 ms 4608 KB
10.txt AC 30 ms 4608 KB
11.txt AC 43 ms 18560 KB
12.txt AC 39 ms 13696 KB
13.txt AC 36 ms 11392 KB
14.txt AC 34 ms 9216 KB
15.txt AC 32 ms 7808 KB
16.txt AC 30 ms 6528 KB
17.txt AC 30 ms 5760 KB
18.txt AC 29 ms 5248 KB
19.txt AC 30 ms 4992 KB
20.txt AC 30 ms 4992 KB
21.txt AC 16 ms 3960 KB
22.txt AC 17 ms 3880 KB
23.txt AC 17 ms 3832 KB
24.txt AC 16 ms 3840 KB
25.txt AC 16 ms 3840 KB
26.txt AC 17 ms 3712 KB
27.txt AC 17 ms 3584 KB
28.txt AC 17 ms 3584 KB
29.txt AC 17 ms 3584 KB
30.txt AC 18 ms 3584 KB
31.txt AC 25 ms 4608 KB
32.txt AC 24 ms 4096 KB
33.txt AC 22 ms 3712 KB
34.txt AC 22 ms 3712 KB
35.txt AC 21 ms 3840 KB
36.txt AC 19 ms 3456 KB
37.txt AC 18 ms 3456 KB
38.txt AC 17 ms 3456 KB
39.txt AC 16 ms 3456 KB
40.txt AC 16 ms 3456 KB
41.txt AC 3 ms 256 KB
42.txt AC 3 ms 256 KB
43.txt AC 3 ms 256 KB
44.txt AC 3 ms 256 KB
45.txt AC 3 ms 256 KB
46.txt AC 3 ms 256 KB
47.txt AC 3 ms 256 KB
48.txt AC 3 ms 256 KB
49.txt AC 3 ms 256 KB
50.txt AC 3 ms 256 KB
s1.txt AC 3 ms 256 KB
s2.txt AC 3 ms 256 KB
s3.txt AC 3 ms 256 KB