Submission #370669

#TimeUsernameProblemLanguageResultExecution timeMemory
370669TosakaUCWPoklon (COCI17_poklon7)C++17
90 / 120
1104 ms165532 KiB
#include <stdio.h> #include <algorithm> #include <vector> int read(int x = 0, int f = 0, char ch = getchar()) { while ('0' > ch or ch > '9') f = ch == '-', ch = getchar(); while ('0' <= ch and ch <= '9') x = x * 10 + (ch ^ 48), ch = getchar(); return f ? -x : x; } const int N = 1e6 + 5; int n; int L[N], R[N]; void convert(std::vector<int> &res, int x) { res.clear(); for (; x; x /= 2) res.push_back(x % 2); std::reverse(res.begin(), res.end()); } std::vector<int> dfs(int v) { std::vector<int> a, b; if (L[v] > 0) a = dfs(L[v]); else convert(a, -L[v]); if (R[v] > 0) b = dfs(R[v]); else convert(b, -R[v]); if (a.size() < b.size()) swap(a, b); if (a.size() ^ b.size()) return a.push_back(0), a; for (int i = 0; i < a.size(); i++) if (a[i] ^ b[i]) { if (b[i] == 1) std::swap(a, b); break; } return a.push_back(0), a; } int main() { // freopen("poklon.in", "r", stdin), freopen("poklon.out", "w", stdout); n = read(); for (int i = 1; i <= n; i++) L[i] = read(), R[i] = read(); std::vector<int> ans = dfs(1); for (auto x : ans) printf("%d", x); return 0; }

Compilation message (stderr)

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