oj.uz

답안 #67132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
67132 2018-08-13T11:16:31 Z osmanorhan Balanced Tree (info1cup18_balancedtree) C++17
0 / 100
 351 ms 47532 KB 
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <cassert>
#include <vector>
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
#define umax( x , y ) x = max( x , (y) )
#define umin( x , y ) x = min( x , (y) )
#define For( i , a ) for(int i=1;i<=a;i++)
#define ort (b+s)/2
#define y2 asrwjaelkf
#define y1 asseopirwjaelkf
#define set multiset

using namespace std;

typedef long long Lint;
typedef double db;
typedef pair<int,int> ii;
typedef pair<int,char> ic;
typedef pair<db,db> dd;
typedef pair<int,ii> iii;
typedef pair<ii,ii> i4;

const int maxn = 100020;
const int maxm = 1000020;
const int MOd = 998244353;

int a, ar[maxn];
vector<int> w[maxn];

void solve() {
	scanf("%d",&a);
	for(int i=1,j,k;i<a;i++) {
		scanf("%d %d",&j,&k);
		w[j].pb( k );
		w[k].pb( j );
	}
	for(int i=1;i<=a;i++) scanf("%d",&ar[i]);

	printf("1\n");
	for(int i=1;i<=a;i++) printf("0 "); printf("\n");

	for(int i=1;i<=a;i++) w[i].clear();
}

int main() {

    //freopen("asd.in","r",stdin);
    //freopen("output17.txt","w",stdout);

	int n;
	scanf("%d",&n);
	while( n-- ) solve();

	return 0;
}

Compilation message

balancedtree.cpp: In function 'void solve()':
balancedtree.cpp:54:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  for(int i=1;i<=a;i++) printf("0 "); printf("\n");
  ^~~
balancedtree.cpp:54:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  for(int i=1;i<=a;i++) printf("0 "); printf("\n");
                                      ^~~~~~
balancedtree.cpp:45:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&a);
  ~~~~~^~~~~~~~~
balancedtree.cpp:47:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&j,&k);
   ~~~~~^~~~~~~~~~~~~~~
balancedtree.cpp:51:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=a;i++) scanf("%d",&ar[i]);
                        ~~~~~^~~~~~~~~~~~~
balancedtree.cpp: In function 'int main()':
balancedtree.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 2680 KB Output isn't correct
2 Incorrect 9 ms 2976 KB Output isn't correct

Subtask #2
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 40 ms 3896 KB Output isn't correct
2 Incorrect 72 ms 7004 KB Output isn't correct
3 Incorrect 59 ms 7092 KB Output isn't correct

Subtask #3
0.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 38 ms 7432 KB Output isn't correct
2 Incorrect 75 ms 12408 KB Output isn't correct
3 Incorrect 46 ms 12408 KB Output isn't correct

Subtask #4
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 52 ms 12408 KB Output isn't correct
2 Incorrect 44 ms 12408 KB Output isn't correct
3 Incorrect 48 ms 13428 KB Output isn't correct
4 Incorrect 38 ms 14044 KB Output isn't correct
5 Incorrect 35 ms 15072 KB Output isn't correct
6 Incorrect 47 ms 16392 KB Output isn't correct
7 Incorrect 46 ms 17236 KB Output isn't correct
8 Incorrect 59 ms 17832 KB Output isn't correct
9 Incorrect 35 ms 18860 KB Output isn't correct

Subtask #5
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 2680 KB Output isn't correct
2 Incorrect 9 ms 2976 KB Output isn't correct
3 Incorrect 40 ms 3896 KB Output isn't correct
4 Incorrect 72 ms 7004 KB Output isn't correct
5 Incorrect 59 ms 7092 KB Output isn't correct
6 Incorrect 38 ms 7432 KB Output isn't correct
7 Incorrect 75 ms 12408 KB Output isn't correct
8 Incorrect 46 ms 12408 KB Output isn't correct
9 Incorrect 52 ms 12408 KB Output isn't correct
10 Incorrect 44 ms 12408 KB Output isn't correct
11 Incorrect 48 ms 13428 KB Output isn't correct
12 Incorrect 38 ms 14044 KB Output isn't correct
13 Incorrect 35 ms 15072 KB Output isn't correct
14 Incorrect 47 ms 16392 KB Output isn't correct
15 Incorrect 46 ms 17236 KB Output isn't correct
16 Incorrect 59 ms 17832 KB Output isn't correct
17 Incorrect 35 ms 18860 KB Output isn't correct
18 Incorrect 234 ms 26072 KB Output isn't correct
19 Incorrect 351 ms 36280 KB Output isn't correct
20 Incorrect 161 ms 36280 KB Output isn't correct
21 Runtime error 68 ms 47532 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Runtime error 82 ms 47532 KB Execution killed with signal 11 (could be triggered by violating memory limits)