이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "friend.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const ll N = 2e3 + 10;
vector<ll> g[N];
bool was[N];
ll we[N];
ll col[N];
vector<int> comp;
void dfs2(ll v, ll a) {
comp.pb(v);
col[v] = a;
was[v] = 1;
for(auto u : g[v]) {
if(!was[u]) {
dfs2(u, a^3);
}
assert(col[v] != col[u]);
}
}
int findSample(int n,int confidence[],int host[],int protocol[]){
bool eq = 1;
for(int j = 0; j < n; j++)
we[j] = confidence[j];
for(int j = 1; j < n; j++) {
if(protocol[j] == 0) {
g[j].pb(host[j]);
g[host[j]].pb(j);
} else if(protocol[j] == 1) {
for(auto u : g[host[j]]) {
g[j].pb(u);
g[u].pb(j);
}
} else if(protocol[j] == 2) {
for(auto u : g[host[j]]) {
g[j].pb(u);
g[u].pb(j);
}
g[j].pb(host[j]);
g[host[j]].pb(j);
assert(0);
}
}
ll answ = 0;
for(int i = 0; i < n; i++)
comp.clear(), was[i] = 0, assert(we[i] == 1);
for(int i = 0; i < n; i++) {
if(!was[i]) {
comp.clear();
dfs2(i, 2);
ll kek = 0;
ll kek2 = 0;
for(auto u : comp) {
if(col[u] == 1)kek++;
else if(col[u] == 2)kek2++;
else assert(0);
}
answ += max(kek, kek2);
comp.clear();
}
}
return answ;
return 0;
}
/*
6
13 3 6 20 10 15
0 0 0 1 1 2 2 1 0 0
6
13 3 6 20 10 15
0 0 0 1 1 2 2 1 0 0
*/
/*
#define __MAXSIZE__ 100002
#include "friend.h"
using namespace std;
// Confidence
int confidence[__MAXSIZE__];
// Host
int host[__MAXSIZE__];
// Protocol
int protocol[__MAXSIZE__];
// Main
int main(void)
{
int n,i;
// Number of people
assert(scanf("%d",&n)==1);
// Confidence
for(i=0;i<n;i++)
assert(scanf("%d",&confidence[i])==1);
// Host and Protocol
for(i=1;i<n;i++)
assert(scanf("%d %d",&host[i],&protocol[i])==2);
// Answer
printf("%d\n",findSample(n,confidence,host,protocol));
return 0;
}
/**/
컴파일 시 표준 에러 (stderr) 메시지
friend.cpp:117:1: warning: "/*" within comment [-Wcomment]
117 | /**/
|
friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:31:10: warning: unused variable 'eq' [-Wunused-variable]
31 | bool eq = 1;
| ^~| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |