Submission #281714

#TimeUsernameProblemLanguageResultExecution timeMemory
281714SamAndFriend (IOI14_friend)C++17
0 / 100
2 ms2688 KiB
#include "friend.h" #include <bits/stdc++.h> using namespace std; const int N = 100005; int n; vector<int> g[N]; int q1, q2; bool c[N]; void dfs(int x, int gg) { c[x] = true; if (gg == 1) ++q1; else ++q2; for (int i = 0; i < g[x].size(); ++i) { int h = g[x][i]; if (!c[h]) dfs(h, 3 - gg); } } int findSample(int n, int confidence[], int host[], int protocol[]) { ::n = n; for (int i = 1; i < n; ++i) { if (protocol[i] == 0) { g[host[i]].push_back(i); g[i].push_back(host[i]); } else { for (int j = 0; j < g[host[i]].size(); ++j) { int h = g[host[i]][j]; g[h].push_back(i); g[i].push_back(h); } } } int ans = 0; for (int x = 0; x < n; ++x) { if (!c[x]) { dfs(x, 1); ans += max(q1, q2); } } return ans; }

Compilation message (stderr)

friend.cpp: In function 'void dfs(int, int)':
friend.cpp:18:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 0; i < g[x].size(); ++i)
      |                     ~~^~~~~~~~~~~~~
friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:38:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |             for (int j = 0; j < g[host[i]].size(); ++j)
      |                             ~~^~~~~~~~~~~~~~~~~~~
#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...