Submission #64103

#TimeUsernameProblemLanguageResultExecution timeMemory
64103Just_Solve_The_Problempopa (BOI18_popa)C++11
0 / 100
117 ms620 KiB
#include "popa.h" #include <bits/stdc++.h> #define pb push_back #define pii pair < int, int > #define fr first #define sc second #define mk make_pair using namespace std; int tab[123][123]; pii ar[123]; int used[123]; int solve(int n, int left[], int right[]) { assert(n == 100); memset(used, sizeof used, 0); memset(tab, sizeof tab, 0); for (int i = 0; i < n; i++) left[i] = right[i] = -1; int root = 0; int mx = 0; for (int i = 0; i < n; i++) { int len = 0; for (int j = 0; j < n; j++) { if (j == i) continue; tab[i][j] = query(i, i, j, j); if (tab[i][j]) { len++; } } ar[i] = mk(len, i); } sort(ar, ar + n); reverse(ar, ar + n); root = ar[0].sc; queue < int > q; q.push(root); used[root] = 1; while (!q.empty()) { int v = q.front(); q.pop(); int mx = -1; for (int i = 0; i < n; i++) { if (used[ar[i].sc]) continue; if (tab[v][ar[i].sc]) { mx = ar[i].sc; break; } } if (mx != -1) { used[mx] = 1; left[v] = mx; q.push(mx); } mx = -1; for (int i = 0; i < n; i++) { if (used[ar[i].sc]) continue; if (tab[v][ar[i].sc]) { mx = ar[i].sc; break; } } if (mx != -1) { used[mx] = 1; right[v] = mx; q.push(mx); } } return root; }

Compilation message (stderr)

popa.cpp: In function 'int solve(int, int*, int*)':
popa.cpp:18:30: warning: 'memset' used with constant zero length parameter; this could be due to transposed parameters [-Wmemset-transposed-args]
   memset(used, sizeof used, 0);
                              ^
popa.cpp:19:28: warning: 'memset' used with constant zero length parameter; this could be due to transposed parameters [-Wmemset-transposed-args]
   memset(tab, sizeof tab, 0);
                            ^
popa.cpp:23:7: warning: unused variable 'mx' [-Wunused-variable]
   int mx = 0;
       ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...