oj.uz

답안 #936980

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936980 2024-03-03T07:40:10 Z gaga999 Naboj (COCI22_naboj) C++17
110 / 110
 74 ms 20084 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 2e5 + 5;
int pd[N];
vector<int> eg[N];

signed main()
{
    int n, m, x, y;
    rd(n, m);
    while (m--)
        rd(x, y), eg[y].pb(x), pd[x]++;
    queue<int> q;
    vector<int> ans;
    for (int i = 1; i <= n; i++)
        if (!pd[i])
            q.push(i);
    while (!q.empty())
    {
        x = q.front(), q.pop(), ans.pb(x);
        for (int v : eg[x])
            if (!--pd[v])
                q.push(v);
    }
    for (int i = 1; i <= n; i++)
        if (pd[i])
            puts("-1"), exit(0);
    prt(n), putchar('\n');
    for (int i : ans)
        prt(i), puts(" 1");
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 5036 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 5140 KB Output is correct
12 Correct 2 ms 5140 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 13032 KB Output is correct
2 Correct 39 ms 15140 KB Output is correct
3 Correct 18 ms 10452 KB Output is correct
4 Correct 34 ms 15304 KB Output is correct
5 Correct 36 ms 15200 KB Output is correct
6 Correct 37 ms 15308 KB Output is correct
7 Correct 41 ms 15164 KB Output is correct
8 Correct 28 ms 12996 KB Output is correct
9 Correct 36 ms 15308 KB Output is correct
10 Correct 38 ms 15308 KB Output is correct

Subtask #3
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 5036 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 5140 KB Output is correct
12 Correct 2 ms 5140 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 38 ms 13032 KB Output is correct
16 Correct 39 ms 15140 KB Output is correct
17 Correct 18 ms 10452 KB Output is correct
18 Correct 34 ms 15304 KB Output is correct
19 Correct 36 ms 15200 KB Output is correct
20 Correct 37 ms 15308 KB Output is correct
21 Correct 41 ms 15164 KB Output is correct
22 Correct 28 ms 12996 KB Output is correct
23 Correct 36 ms 15308 KB Output is correct
24 Correct 38 ms 15308 KB Output is correct
25 Correct 36 ms 14416 KB Output is correct
26 Correct 43 ms 14804 KB Output is correct
27 Correct 42 ms 15700 KB Output is correct
28 Correct 74 ms 17036 KB Output is correct
29 Correct 30 ms 14816 KB Output is correct
30 Correct 47 ms 16720 KB Output is correct
31 Correct 7 ms 7000 KB Output is correct
32 Correct 41 ms 17664 KB Output is correct
33 Correct 65 ms 19816 KB Output is correct
34 Correct 45 ms 17884 KB Output is correct
35 Correct 66 ms 19668 KB Output is correct
36 Correct 41 ms 17352 KB Output is correct
37 Correct 58 ms 19140 KB Output is correct
38 Correct 54 ms 18632 KB Output is correct
39 Correct 68 ms 19672 KB Output is correct
40 Correct 74 ms 19152 KB Output is correct
41 Correct 57 ms 18920 KB Output is correct
42 Correct 71 ms 19996 KB Output is correct
43 Correct 45 ms 18128 KB Output is correct
44 Correct 70 ms 20084 KB Output is correct
45 Correct 44 ms 17608 KB Output is correct
46 Correct 58 ms 18892 KB Output is correct