제출 #841643

#제출 시각아이디문제언어결과실행 시간메모리
841643Batrr참나무 (IOI23_beechtree)C++17
0 / 100
4 ms18012 KiB
#include "beechtree.h" #include <bits/stdc++.h> #define f first #define s second #define pb push_back #define mp make_pair using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<long long, long long> pll; const int N = 300500, inf = 1e9, mod = 998244353; const ll INF = 1e18; vector<pii> g[N]; int n, m; int ans[N]; int P[N], C[N]; vector<int> t[N]; void dfs(int v) { t[v].pb(v); for (auto it: g[v]) { int to = it.s; dfs(to); for (auto x: t[to]) t[v].pb(x); } sort(t[v].begin(), t[v].end()); do { bool ok = 1; ok &= (t[v][0] == v); for (int i = 1; i < t[v].size(); i++) { int cnt = 0; for (int j = 0; j < i; j++) if (C[t[v][i]] == C[t[v][j]]) cnt++; ok &= (t[v][cnt] == P[t[v][i]]); } if (ok) { ans[v] = 1; } } while (next_permutation(t[v].begin(), t[v].end())); } vector<int> beechtree(int N, int M, vector<int> PP, vector<int> CC) { n = N; for (int i = 1; i < n; i++) g[i].pb({C[i], i}); for (int i = 0; i < n; i++) { sort(g[i].begin(), g[i].end()); P[i] = PP[i]; C[i] = CC[i]; } dfs(0); return vector<int>(ans, ans + n); }

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

beechtree.cpp: In function 'void dfs(int)':
beechtree.cpp:38:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int i = 1; i < t[v].size(); i++) {
      |                         ~~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...