Submission #1282722

#TimeUsernameProblemLanguageResultExecution timeMemory
1282722nikaa123Park (JOI17_park)C++17
Compilation error
0 ms0 KiB
#include "park.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 1505; vector <int> g[MAXN]; int vis[MAXN]; int f[MAXN]; bool blocked[MAXN]; static int p[MAXN]; bool connected[MAXN][MAXN]; int parent[MAXN]; vector <int> curr, e, curr2; int n; void dfs3(int v){ curr2.push_back(v); for(auto u : g[v]){ if(!vis[u]){ dfs3(u); } } } void dfs2(int v, int a){ while(true){ curr2.clear(); dfs3(v); if(vis[v]){ return; } for(int i = 0; i < n; i++){ p[i] = 0; } for(auto ele : curr2){ p[ele] = 1; } p[a] = 1; if(!Ask(min(v, a), max(v, a), p)){ return; } int lo = 0; int hi = sz(curr2) - 1; int mid, res; while(lo <= hi){ mid = (lo + hi) / 2; for(int i = 0; i < n; i++){ p[i] = 0; } for(int i = 0; i <= mid; i++){ p[curr2[i]] = 1; } p[a] = 1; if(Ask(min(v, a), max(v, a), p)){ res = curr2[mid]; hi = mid - 1; }else{ lo = mid + 1; } } vis[res] = 1; e.push_back(res); for(auto u : g[res]){ dfs2(u, a); } } } void merge(int a){ if(f[a]){ return; } for(int i = 0; i < n; i++){ p[i] = f[i]; } p[a] = 1; while(!Ask(0, a, p)){ int lo = 0; int hi = n - 1; int mid, res; while(lo <= hi){ mid = (lo + hi) / 2; for(int i = 0; i < n; i++){ if(f[i] || i <= mid){ p[i] = 1; }else{ p[i] = 0; } } p[a] = 1; if(Ask(0, a, p)){ hi = mid - 1; res = mid; }else{ lo = mid + 1; } } merge(res); } for(int i = 0; i < n; i++){ vis[i] = 0; } e.clear(); dfs2(0,a); for(auto ele : e){ Answer(min(ele, a), max(ele, a)); } parent[a] = e[0]; g[e[0]].push_back(a); f[a] = 1; } void Detect(int T, int N){ for(int i = 0; i < MAXN; i++){ f[i] = 0; p[i] = 0; } n = N; f[0] = 1; for(int i = 1; i < n; i++){ merge(i); } }

Compilation message (stderr)

park.cpp: In function 'void dfs2(int, int)':
park.cpp:47:26: error: 'sz' was not declared in this scope
   47 |                 int hi = sz(curr2) - 1;
      |                          ^~