| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1324820 | tsetsenbileg | 친구 (IOI14_friend) | C++20 | 1 ms | 332 KiB |
#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
using pr = pair<int, int>;
const int INF = 1e9+7, MOD = 1e9+7;
// Find out best sample
int findSample(int n,int a[],int host[],int type[]){
vector<int> col(n);
col[0] = 0;
for (int i = 1; i < n; i++) {
if (type[i] == 0) {
col[i] = col[host[i]] ^ 1;
}
else {
col[i] = col[host[i]];
}
}
int cnt[2] = {0, 0};
for (int i = 0; i < n; i++) cnt[col[i]]++;
return max(cnt[0], cnt[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... | ||||
