Submission #1124682

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1124682	2024-12-06 21:05:16	HasanV11010238	Naboj (COCI22_naboj)	C++20	110 / 110	931 ms	73520 KiB

naboj

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAX 1000000
#define mod 998244353
set<int> s;
vector<set<int>> v, vr;
void check(int x){
    if ((v[x].size() + vr[x].size()) == 0) return;
    if (v[x].size() == 0) s.insert(x);
    if (vr[x].size() == 0) s.insert(x);
}
int main(){
    int n, m, a, b;
    cin>>n>>m;
    v.assign(n + 1, set<int>()), vr.assign(n + 1, set<int>());
    for (int i = 0; i < m; i++){
        cin>>a>>b;
        v[b].insert(a);
        vr[a].insert(b);
    }
    for (int i = 1; i <= n; i++){
        check(i);
    }
    vector<vector<int>> ord;
    while (!s.empty()){
        int x = *s.begin();
        s.erase(s.begin());
        if ((v[x].size() + vr[x].size()) == 0) continue;
        if (v[x].size() == 0){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 25 / 25
• Subtask 3: 70 / 70