oj.uz

Submission #211940

# Submission time Handle Problem Language Result Execution time Memory
211940 2020-03-21T19:36:09 Z tleontest1 Birokracija (COCI18_birokracija) C++14
100 / 100
 162 ms 30328 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define int long long
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,sub[li],sub1[li];
int cev;
string s;
vector<int> v[li];

inline void dfs(int node,int ata){
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i];
		if(go==ata)continue;
		dfs(go,node);
		sub[node]+=sub[go];
		sub1[node]+=sub1[go];
	}
	
	sub1[node]++;
	sub[node]+=sub1[node];
}

main(void){
	scanf("%lld",&n);
	for(int i=2;i<=n;i++){
		int x;
		scanf("%lld",&x);
		v[i].pb(x);
		v[x].pb(i);
	}
	dfs(1,0);
	FOR printf("%lld ",sub[i]);
	return 0;
}

Compilation message

birokracija.cpp:48:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
birokracija.cpp: In function 'int main()':
birokracija.cpp:49:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
  ~~~~~^~~~~~~~~~~
birokracija.cpp:52:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&x);
   ~~~~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12160 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12136 KB Output is correct
2 Correct 12 ms 12152 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12132 KB Output is correct
2 Correct 14 ms 12032 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12160 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 13312 KB Output is correct
2 Correct 23 ms 13568 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 16376 KB Output is correct
2 Correct 44 ms 16356 KB Output is correct
3 Correct 40 ms 17016 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 24232 KB Output is correct
2 Correct 92 ms 25080 KB Output is correct
3 Correct 102 ms 30328 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 24336 KB Output is correct
2 Correct 98 ms 24568 KB Output is correct
3 Correct 90 ms 25720 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 24056 KB Output is correct
2 Correct 96 ms 24696 KB Output is correct
3 Correct 96 ms 26744 KB Output is correct