제출 #1078961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1078961		Hanksburger	September (APIO24_september)	C++17	100 / 100	134 ms	10448 KiB

september

#include "september.h"
#include <bits/stdc++.h>
using namespace std;
set<int> buff[5], s;
vector<int> p, tmp;
int deg[100005];
void process(int u)
{
    if (deg[u])
        s.insert(u);
    else
    {
        deg[p[u]]--;
        while (!deg[p[u]] && s.find(p[u])!=s.end())
        {
            u=p[u];
            s.erase(u);
            deg[p[u]]--;
        }
    }
}
int solve(int n, int m, vector<int> P, vector<vector<int> > a)
{
    p=P;
    for (int i=1; i<n; i++)
        deg[p[i]]++;
    int cnt=0;
    for (int i=0; i<=n-2; i++)
    {
        for (int j=0; j<m; j++)
            buff[j].insert(a[j][i]);
        int u=*buff[0].begin(), ok=1;
        while (1)
        {
            for (int j=1; j<m; j++)
            {
                if (buff[j].find(u)==buff[j].end())
                {
                    ok=0;
                    break;
                }
            }
            if (!ok)
                break;
            tmp.push_back(u);
            for (int j=0; j<m; j++)
                buff[j].erase(u);
            if (buff[0].empty())
                break;
            u=*buff[0].begin();
        }
        if (buff[0].empty())
        {
            for (int j=0; j<tmp.size(); j++)
                process(tmp[j]);
            tmp.clear();
            if (s.empty())
                cnt++;
        }
    }
    return cnt;
}

컴파일 시 표준 에러 (stderr) 메시지

september.cpp: In function 'int solve(int, int, std::vector<int>, std::vector<std::vector<int> >)':
september.cpp:54:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |             for (int j=0; j<tmp.size(); j++)
      |                           ~^~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 14 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 5 / 5
• Subtask 6: 11 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 9 / 9
• Subtask 10: 16 / 16