# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084833 | Timosh | September (APIO24_september) | C++17 | 1 ms | 604 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
// #include "september.h"
int solve(int N, int M, vector<int> F, vector<vector<int>> S)
{
vector<int> freq(N);
int ans = 0;
for (int i = 1; i < N; i++)
freq[F[i]]++;
map<int, int> mp;
int cnt = 0;
set<int> need;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < M; j++)
{
mp[S[j][i]]++;
if (mp[S[j][i]] == 1)
cnt++;
if (mp[S[j][i]] == M)
cnt--;
}
if (cnt == 0)
{
for (auto &[key, val] : mp)
{
freq[F[key]]--;
if (freq[F[key]] == 0)
need.erase(F[key]);
# | 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... |