제출 #1340323

#제출 시각아이디문제언어결과실행 시간메모리
1340323nicolo_010Friend (IOI14_friend)C++20
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;

vector<vector<int>> adj;
vector<int> col;
vector<bool> vis;

void dfs(int u, int p=-1, int d=0) {
	vis[u] = true;
	col[u] = d;
	for (auto v : adj[u]) {
		if (vis[v]) continue;
		dfs(v, u, 1-d);
	}
}

int findSample(int n, int a[], int host[], int queries[]) {
	vector<vector<int>> grid(n, vector<int>(n, 0));
	adj.assign(n, {});
	col.assign(n, -1);
	vis.assign(n, false);
	for (int i=1; i<n; i++) {
		int u = host[i];
		if (queries[i] == 0) {
			grid[u][i] = grid[i][u] = 1;
			adj[u].push_back(i);
			adj[i].push_back(u);
		}
		else if (queries[i] == 1) {
			for (int j=0; j<i; j++) {
				if (grid[u][j]) {
					//cout << i << " " << j << endl;
					grid[i][j] = grid[j][i] = 1;
					adj[i].push_back(j);
					adj[j].push_back(i);
				}
			}	
		}
		else {
			for (int j=0; j<i; j++) {
				if (grid[u][j]) {
					//cout << i << " " << j << endl;
					grid[i][j] = grid[j][i] = 1;
					adj[i].push_back(j);
					adj[j].push_back(i);
				}
			}
			grid[u][i] = grid[i][u] = 1;
			adj[u].push_back(i);
			adj[i].push_back(u);
		}
	}
	int ev=0, odd=0;
	dfs(0);
	for (int i=0; i<n; i++) {
		ans = max(ans, a[i]);
	}
	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:59:17: error: 'ans' was not declared in this scope; did you mean 'abs'?
   59 |                 ans = max(ans, a[i]);
      |                 ^~~
      |                 abs
friend.cpp:61:16: error: 'ans' was not declared in this scope; did you mean 'abs'?
   61 |         return ans;
      |                ^~~
      |                abs