Submission #453665

#TimeUsernameProblemLanguageResultExecution timeMemory
453665JokubasFire drill (LMIO18_sauga)C++14
46.36 / 100
184 ms7440 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...