| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1367982 | nathlol2 | September (APIO24_september) | C++20 | 1095 ms | 1728 KiB |
#include "september.h"
#include <bits/stdc++.h>
using namespace std;
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
vector<vector<int>> deg(N, vector<int>(M)), adj(N);
for(int i = 1;i<N;i++){
for(int j = 0;j<M;j++) deg[F[i]][j]++;
adj[F[i]].push_back(i);
}
int ans = 0;
set<int> s[M], c[M], cc;
for(int i = 0;i<N - 1;i++){
bool bigf = 1;
for(int k = 0;k<M;k++){
cc.insert(S[k][i]);
s[k].insert(S[k][i]);
for(auto v : adj[S[k][i]]) c[k].insert(v);
bool f = 1;
for(auto x : c[k]) if(s[k].find(x) == s[k].end()) f = 0;
bigf &= f;
}
if(bigf && cc.size() == i + 1) ++ans;
}
return ans;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
