Submission #26708

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
26708	2017-07-05 08:46:10	dongwon0427	트리 (KOI16_tree)	C++98	0 / 100	3 ms	35744 KiB

tree

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int n,q;
vector<int> graph[200005];
int H[200005];
int vt[200005];
int E[200005];
vector<int> G[200005];
int depth[200005];
int dfs(int idx,int cnt) {
    H[idx]=cnt;
    vt[idx]=1;
    //printf("%d : %d\n",idx,cnt);
    for(int i=0;i<graph[idx].size();i++) {
        int nxt=graph[idx][i];
        if(vt[nxt]==0) {
            cnt=dfs(nxt,++cnt)+1;
        }
    }
    E[H[idx]]=cnt;
    return cnt-1;
}
int ANC[200005][22];
int vtANC[200005];
void anc(int idx){
    if(vtANC[idx]==1) return;
    vtANC[idx]=1;
    for(int i=0;i<G[idx].size();i++) {
        int nxt=G[idx][i];
        ANC[nxt][0]=idx;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

tree.cpp: In function 'int dfs(int, int)':
tree.cpp:14:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<graph[idx].size();i++) {
                  ^
tree.cpp:17:33: warning: operation on 'cnt' may be undefined [-Wsequence-point]
             cnt=dfs(nxt,++cnt)+1;
                                 ^
tree.cpp: In function 'void anc(int)':
tree.cpp:28:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<G[idx].size();i++) {
                  ^
tree.cpp: In function 'int getA(int, int)':
tree.cpp:60:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
tree.cpp: In function 'int main()':
tree.cpp:85:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0;j<graph[i].size();j++) {
                      ^
tree.cpp:75:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&q);
                        ^
tree.cpp:78:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&tmp);
                         ^
tree.cpp:100:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&t1,&t2,&t3);
                                    ^

• Subtask 1: 0 / 9
• Subtask 2: 0 / 13
• Subtask 3: 0 / 14
• Subtask 4: 0 / 19
• Subtask 5: 0 / 45