161512025-04-07 07:03:58BencuKritikus munkákcpp17Wrong answer 0/100180ms8760 KiB
#include <bits/stdc++.h>

using namespace std;
int n,m;

struct Bencu {
    vector<int>munka;
}a[100001];

int main()
{
    ifstream f("be.in");
    cin>>n>>m;
    for (int i=1; i<=m; i++) {
        int x,y;
        cin>>x>>y;
        a[y].munka.push_back(x);
    }
    cout<<0<<endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Wrong answer3ms2612 KiB
2Wrong answer112ms6704 KiB
subtask20/25
3Accepted3ms2752 KiB
4Wrong answer3ms2612 KiB
5Wrong answer4ms2612 KiB
6Wrong answer3ms2796 KiB
7Accepted4ms2612 KiB
subtask30/25
8Accepted32ms3544 KiB
9Wrong answer14ms3072 KiB
10Wrong answer14ms3052 KiB
11Wrong answer24ms3124 KiB
12Wrong answer24ms3240 KiB
subtask40/25
13Accepted75ms5172 KiB
14Wrong answer86ms5684 KiB
15Wrong answer85ms5428 KiB
16Wrong answer79ms5500 KiB
17Wrong answer79ms5384 KiB
subtask50/25
18Wrong answer180ms8760 KiB
19Wrong answer172ms8756 KiB
20Wrong answer167ms8648 KiB
21Wrong answer175ms8500 KiB
22Wrong answer153ms8244 KiB