답안 #453665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
453665 2021-08-04T13:56:22 Z Jokubas Fire drill (LMIO18_sauga) C++14
46.3605 / 100
184 ms 7440 KB
#include <iostream>
#include <bits/stdc++.h>
#define pb push_back

using namespace std;

/*void setIO(string s)
{
    freopen((s + ".in").c_str(), "r", stdin);
}*/

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(nullptr);
    //setIO("input");

    int T, N, S;
    cin>>T>>N>>S;

    int kiek[N+1] = {0};
    vector<int> listas[N+1];

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> eil;

    for(int i = 1; i<=N; i++)
    {
        int M;
        cin>>M;
        int a;
        //int b = 0;
        for(int j = 0; j<M; j++)
        {
            cin>>a;
            kiek[i]++;
            listas[a].pb(i);
        }


        eil.push(make_pair(kiek[i], i));
    }


    /*0 4 1
    2 2 3
    0
    1 4
    1 1*/


    map<int, bool> istrinti;

    while(!eil.empty())
    {
        int a = eil.top().second;
        eil.pop();
        if(!istrinti.count(a))
        {
            for(auto c : listas[a])
            {

                if(!istrinti.count(c))
                {
                    kiek[c]--;
                    eil.push(make_pair(kiek[c], c));
                }
            }
            istrinti[a] = 1;
            cout<<a<<"\n";
        }
    }





    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 7220 KB Output is correct
2 Partially correct 2 ms 332 KB Output is partially correct
3 Partially correct 2 ms 332 KB Output is partially correct
4 Partially correct 3 ms 460 KB Output is partially correct
5 Partially correct 2 ms 332 KB Output is partially correct
6 Partially correct 3 ms 460 KB Output is partially correct
7 Partially correct 27 ms 1888 KB Output is partially correct
8 Partially correct 133 ms 7440 KB Output is partially correct
9 Partially correct 20 ms 1244 KB Output is partially correct
10 Partially correct 1 ms 332 KB Output is partially correct