提出 #65023663

---

ソースコード 拡げる

// Problem: C - Dislike Foods
// Contest: AtCoder - Tokio Marine & Nichido Fire Insurance Programming Contest 2025  (AtCoder Beginner Contest 402)
// URL: https://atcoder.jp/contests/abc402/tasks/abc402_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

// clang-format off
bool unit_test = false;
#ifndef ONLINE_JUDGE
#include "ahmedsameh"
#else
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <chrono>
#include <random>
#include <thread>
#include <ctime>
std::mt19937_64 rng(std::chrono::system_clock::now().time_since_epoch().count());
int64_t rand(int64_t l,int64_t r) { return std::uniform_int_distribution<int64_t>(l, r)(rng); }
#define debug(x...) 42
using namespace std;
#endif
#define fo(i, k, n) for(int i = k; k < n ? i <= n : i >= n; k < n ? ++i : --i)
#define fall(arr, x) fill(arr, arr + sizeof(arr) / sizeof(arr[0]), x)
#define rall(vec) (vec).rbegin(), (vec).rend()
#define all(vec) (vec).begin(), (vec).end()
#define check(x) cout << (x ? "YES" : "NO")
#define lcm(a, b) (a * ( b / gcd(a, b)))
#define sz(vec) ((int)vec.size())
#define _CRT_SECURE_NO_WARNINGS
#define gcd(a, b) __gcd(a, b)
#define mod 1000000007
#define mod2 998244353
#define pb push_back
void solve();
signed main()
{
    ios_base::sync_with_stdio(false);
    cout.tie(NULL);
    cin.tie(NULL);
#ifndef ONLINE_JUDGE
    function<void()> solve_parameter = solve;
    ahmed::unit_test(unit_test, solve_parameter);
#else
    solve();
#endif
    return 0;
}
#define int long long
   /*===================================</darkahmed>===================================*\
    
    █████  ██   ██ ███    ███ ███████ ██████   ███████  █████  ███    ███ ███████ ██   ██
   ██   ██ ██   ██ ████  ████ ██      ██   ██  ██      ██   ██ ████  ████ ██      ██   ██
   ███████ ███████ ██ ████ ██ █████   ██   ██  ███████ ███████ ██ ████ ██ █████   ███████
   ██   ██ ██   ██ ██  ██  ██ ██      ██   ██       ██ ██   ██ ██  ██  ██ ██      ██   ██
   ██   ██ ██   ██ ██      ██ ███████ ██████   ███████ ██   ██ ██      ██ ███████ ██   ██
‎                                      ﴾  ﷽  ﴿                                   
‎        ﴾ وَأَن لَّيْسَ لِلْإِنسَانِ إِلَّا مَا سَعَى ۝ وَأَنَّ سَعْيَـهُ سَـوْفَ يُـرَى ۝ ثُمَّ يُجْـزَاهُ الْجَـزَاءَ الْأَوْفَـى ﴿ٰ
   \*==================================================================================*/
// clang-format on
/**
#define if(x) if(0 | x)
#define while(x) while(0 | x)
/**/
void solve()
{
	int n, m;
	cin >> n >> m;
	vector<int>adj[m];
	vector<int>radj[n];
	for (int i = 0; i < m; i++)
	{
		int k;
		cin >> k;
		for (int j = 0; j < k; j++)
		{
			int num;
			cin >> num;
			adj[i].push_back(num - 1);
			radj[num - 1].push_back(i);
		}
	}
	int arr[n];
	int arr2[n];
	for (int i = 0; i < n; i++)
	{
		cin >> arr2[i];
		arr[arr2[i] - 1] = i;
	}
	for (int i = 0; i < m; i++)
	{
		sort(adj[i].begin(), adj[i].end(), [&](int a, int b) { return arr[a] > arr[b]; });
	}
	int cnt = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j: radj[arr2[i] - 1])
		{
			adj[j].pop_back();
			if (adj[j].empty())
			{
				cnt++;
			}
		}
		cout << cnt << "\n";
	}
}

提出情報

コンパイルエラー

Main.cpp:70:1: warning: "/*" within comment [-Wcomment]
   70 | /**/
      |  

ジャッジ結果