提出 #73817822

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

#define int long long
const int N = 1e5 + 5;
int a[N];
map<pair<int, int>, int> mp;
map<pair<int, int>, int> mp1;
void solve()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> a[i];
    }
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        int k;
        cin >> k;
        for (int j = 1; j <= k; j++)
        {
            int x;
            cin>>x;
            if (mp1[{i, x}])
                continue;
            mp[{i, x}]++;
            ans++;
            if (mp[{i, x}] > a[x])
            {
                ans -= mp[{i, x}];
                mp1[{i, x}]++;
            }
        }
    }
    cout << ans << '\n';
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int T = 1;
    //  cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}

提出情報

提出日時
問題 B - 教室の割り当て
ユーザ BAZzz
言語 C++23 (GCC 15.2.0)
得点 266
コード長 938 Byte
結果 AC
実行時間 125 ms
メモリ 29496 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 266 / 266
結果
AC × 3
AC × 73
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3416 KiB
in02.txt AC 1 ms 3556 KiB
in03.txt AC 1 ms 3584 KiB
in04.txt AC 1 ms 3628 KiB
in05.txt AC 1 ms 3584 KiB
in06.txt AC 1 ms 3536 KiB
in07.txt AC 1 ms 3552 KiB
in08.txt AC 3 ms 4336 KiB
in09.txt AC 92 ms 29444 KiB
in10.txt AC 1 ms 3540 KiB
in11.txt AC 119 ms 15276 KiB
in12.txt AC 9 ms 4452 KiB
in13.txt AC 107 ms 11720 KiB
in14.txt AC 5 ms 3584 KiB
in15.txt AC 83 ms 16864 KiB
in16.txt AC 85 ms 29364 KiB
in17.txt AC 75 ms 16128 KiB
in18.txt AC 83 ms 29456 KiB
in19.txt AC 8 ms 4436 KiB
in20.txt AC 10 ms 4308 KiB
in21.txt AC 8 ms 4456 KiB
in22.txt AC 46 ms 16924 KiB
in23.txt AC 67 ms 16940 KiB
in24.txt AC 1 ms 3560 KiB
in25.txt AC 1 ms 3592 KiB
in26.txt AC 1 ms 3416 KiB
in27.txt AC 1 ms 3540 KiB
in28.txt AC 1 ms 3544 KiB
in29.txt AC 1 ms 3704 KiB
in30.txt AC 1 ms 3576 KiB
in31.txt AC 1 ms 3552 KiB
in32.txt AC 1 ms 3516 KiB
in33.txt AC 1 ms 3628 KiB
in34.txt AC 1 ms 3560 KiB
in35.txt AC 1 ms 3588 KiB
in36.txt AC 5 ms 3560 KiB
in37.txt AC 9 ms 4508 KiB
in38.txt AC 9 ms 4312 KiB
in39.txt AC 82 ms 16900 KiB
in40.txt AC 79 ms 16888 KiB
in41.txt AC 74 ms 16520 KiB
in42.txt AC 84 ms 25232 KiB
in43.txt AC 75 ms 25232 KiB
in44.txt AC 45 ms 16860 KiB
in45.txt AC 76 ms 26164 KiB
in46.txt AC 64 ms 12360 KiB
in47.txt AC 80 ms 29484 KiB
in48.txt AC 117 ms 15300 KiB
in49.txt AC 81 ms 29496 KiB
in50.txt AC 125 ms 16940 KiB
in51.txt AC 114 ms 23168 KiB
in52.txt AC 1 ms 3568 KiB
in53.txt AC 1 ms 3552 KiB
in54.txt AC 1 ms 3600 KiB
in55.txt AC 1 ms 3652 KiB
in56.txt AC 1 ms 3488 KiB
in57.txt AC 1 ms 3532 KiB
in58.txt AC 1 ms 3540 KiB
in59.txt AC 1 ms 3536 KiB
in60.txt AC 1 ms 3584 KiB
in61.txt AC 1 ms 3568 KiB
in62.txt AC 1 ms 3576 KiB
in63.txt AC 1 ms 3560 KiB
in64.txt AC 1 ms 3416 KiB
in65.txt AC 1 ms 3612 KiB
in66.txt AC 1 ms 3552 KiB
in67.txt AC 1 ms 3568 KiB
in68.txt AC 1 ms 3576 KiB
in69.txt AC 112 ms 29484 KiB
in70.txt AC 119 ms 15276 KiB
sample01.txt AC 1 ms 3560 KiB
sample02.txt AC 1 ms 3508 KiB
sample03.txt AC 1 ms 3600 KiB