Submission #1205428

#TimeUsernameProblemLanguageResultExecution timeMemory
1205428AndreySphinx's Riddle (IOI24_sphinx)C++20
Compilation error
0 ms0 KiB
#include "sphinx.h" #include<bits/stdc++.h> using namespace std; int n; vector<int> haha[300]; vector<int> no[300]; vector<int> bruh(300); vector<int> col[300]; vector<int> dep[300]; vector<int> odd(0); vector<int> even(0); void dfs(int a) { bruh[a] = -1; for(int v: haha[a]) { if(bruh[v] != -1) { dfs(v); } } } int dude(vector<int> wut) { vector<int> yo(n,n); for(int i = 0; i < n; i++) { bruh[i] = 0; } for(int v: wut) { yo[v] = -1; bruh[v] = -1; } int ans = perform_experiment(yo); for(int i = 0; i < n; i++) { if(bruh[i] != -1) { dfs(i); ans--; } } return ans; } void dfs2(int a, int c) { bruh[a] = -1; for(int v: no[a]) { if(bruh[v] == c) { dfs(v,c); } } } void calc(int p, int c, vector<int> wut) { vector<int> wow(n,n); if(p == 0) { for(int v: odd) { wow[v] = c; } } else { for(int v: even) { wow[v] = c; } } int br = wut.size(); for(int i = 0; i < n; i++) { wow[i] = bruh[i]; } for(int i = 0; i < n; i++) { if(bruh[i] != -1) { br++; dfs(i,bruh[i]); } } vector<int> ans(n); for(int i = 0; i < n; i++) { for(int v: col[i]) { ans[v] = wow[i]; } } if(perform_experiment(ans) < br) { return true; } else { return false; } } std::vector<int> find_colours(int N, std::vector<int> x, std::vector<int> y) { n = N; for(int i = 0; i < x.size(); i++) { haha[x[i]].push_back(y[i]); haha[y[i]].push_back(x[i]); } vector<int> ans(n); for(int i = 1; i < n; i++) { ans[i] = i; vector<int> wut(0); set<int> idk; for(int j = 0; j <= i; j++) { wut.push_back(j); if(j < i) { idk.insert(ans[j]); } } int c = (int)idk.size()-dude(wut)+1; for(int j = 0; j < c; j++) { int l = 0,r = i-1; while(l < r) { int mid = (l+r)/2; wut.clear(); idk.clear(); for(int k = 0; k < i; k++) { if(ans[k] >= l && ans[k] <= mid) { wut.push_back(k); idk.insert(ans[k]); } } wut.push_back(i); if(dude(wut) <= idk.size()) { r = mid; } else { l = mid+1; } } int a = l; for(int k = 0; k < i; k++) { if(ans[k] == a) { ans[k] = i; } } } } for(int i = 0; i < n; i++) { col[ans[i]].push_back(i); } for(int i = 0; i < x.size(); i++) { no[ans[x[i]]].push_back(ans[y[i]]); no[ans[y[i]]].push_back(ans[x[i]]); } vector<int> dep2(n,-1); dep2[n-1] = 0; dep[0].push_back(0); for(int i = 0; i < n; i++) { for(int v: dep[i]) { for(int u: no[v]) { if(dep2[u] == -1) { dep2[u] = i+1; dep[i+1].push_back(u); } } } } for(int i = 0; i < n; i++) { for(int v: dep[i]) { if(i%2) { even.push_back(i); } else { odd.push_back(i); } } } return ans; }

Compilation message (stderr)

sphinx.cpp: In function 'void dfs2(int, int)':
sphinx.cpp:46:16: error: too many arguments to function 'void dfs(int)'
   46 |             dfs(v,c);
      |             ~~~^~~~~
sphinx.cpp:14:6: note: declared here
   14 | void dfs(int a) {
      |      ^~~
sphinx.cpp: In function 'void calc(int, int, std::vector<int>)':
sphinx.cpp:70:16: error: too many arguments to function 'void dfs(int)'
   70 |             dfs(i,bruh[i]);
      |             ~~~^~~~~~~~~~~
sphinx.cpp:14:6: note: declared here
   14 | void dfs(int a) {
      |      ^~~
sphinx.cpp:80:16: error: return-statement with a value, in function returning 'void' [-fpermissive]
   80 |         return true;
      |                ^~~~
sphinx.cpp:83:16: error: return-statement with a value, in function returning 'void' [-fpermissive]
   83 |         return false;
      |                ^~~~~