| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1273355 | kawhiet | 9월 (APIO24_september) | C++20 | 1 ms | 568 KiB |
#include "september.h"
#include <bits/stdc++.h>
using namespace std;
int solve(int n, int m, vector<int> p, vector<vector<int>> s) {
vector<int> d(n);
for (int i = 1; i < n; i++) {
d[i] = d[p[i]] + 1;
}
int res = 0, j = 0, prv = 0;
vector<set<int>> freq(m);
while (j < n - 1) {
for (int i = 0; i < m; i++) {
freq[i].insert(s[i][j]);
}
bool is = 1;
for (int i = 1; i < m; i++) {
if (freq[i] != freq[i - 1]) {
is = 0;
break;
}
}
if (is) {
res++;
for (int i = 0; i < m; i++) {
freq[i].clear();
}
prv = j + 1;
}
j++;
}
return res;
}
| # | 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... | ||||
| # | 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... | ||||
