120892024-12-02 09:14:54RRoliA lehető legkevesebb metróval utazás (40 pont)cpp17Wrong answer 0/40289ms6456 KiB
#include <bits/stdc++.h>
using namespace std;

int n, m, ind, erk;
vector<vector<int>> szom, allomas;

int main() {
	cin >> n >> m >> ind >> erk;
    szom.resize(n+1, vector<int>(0));
    allomas.resize(m+1, vector<int>(0));
    for(int i = 1; i <= n; i++) {
        int a;
        cin >> a;
        for(int j = 1; j <= a; j++) {
            int b;
            cin >> b;
            allomas[b].push_back(i);
        }
    }
    for(int i = 1; i <= m; i++) {
        for(int j = 0; j < allomas[i].size(); j++) {
            
        }
    }


	return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Wrong answer0/01ms320 KiB
2Wrong answer0/04ms824 KiB
3Wrong answer0/21ms320 KiB
4Wrong answer0/21ms508 KiB
5Wrong answer0/21ms320 KiB
6Wrong answer0/21ms320 KiB
7Wrong answer0/22ms320 KiB
8Wrong answer0/22ms496 KiB
9Wrong answer0/24ms724 KiB
10Wrong answer0/23ms568 KiB
11Wrong answer0/22ms320 KiB
12Wrong answer0/26ms824 KiB
13Wrong answer0/26ms944 KiB
14Wrong answer0/24ms940 KiB
15Wrong answer0/2284ms6316 KiB
16Wrong answer0/2286ms6300 KiB
17Wrong answer0/2289ms6296 KiB
18Wrong answer0/2286ms6456 KiB
19Wrong answer0/24ms760 KiB
20Wrong answer0/24ms824 KiB
21Wrong answer0/23ms608 KiB
22Wrong answer0/24ms824 KiB