제출 #67132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
67132		osmanorhan	Balanced Tree (info1cup18_balancedtree)	C++17	0 / 100	351 ms	47532 KiB

balancedtree

#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;
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 26
• Subtask 4: 0 / 45
• Subtask 5: 0 / 6