oj.uz

Submission #83375

# Submission time Handle Problem Language Result Execution time Memory
83375 2018-11-07T12:47:39 Z tjdgus4384 None (KOI17_line) C++14
100 / 100
 217 ms 106640 KB 
#include<cstdio>
int b[100001], s[100001], idx[100001], chk[100001];

int main()
{
    int n, m, x, y;
    scanf("%d %d", &n, &m);
    for(int i = 0;i < m;i++)
    {
        scanf("%d %d", &x, &y);
        b[y]++;
        s[x]++;
    }
    for(int i = 1;i <= n;i++)
    {
        int bb = n - i - s[i];
        int bigger = b[i] + bb;
        idx[i] = n - bigger;
        if(chk[n - bigger])
        {
            printf("-1");
            return 0;
        }
        chk[idx[i]] = 1;
    }
    for(int i = 1;i <= n;i++)
    {
        printf("%d ", idx[i]);
    }
    return 0;
}

Compilation message

line.cpp: In function 'int main()':
line.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
line.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 608 KB Output is correct
10 Correct 2 ms 628 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 608 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Correct 2 ms 628 KB Output is correct
12 Correct 2 ms 680 KB Output is correct
13 Correct 2 ms 832 KB Output is correct
14 Correct 2 ms 832 KB Output is correct
15 Correct 2 ms 832 KB Output is correct
16 Correct 2 ms 832 KB Output is correct
17 Correct 3 ms 836 KB Output is correct
18 Correct 2 ms 864 KB Output is correct
19 Correct 2 ms 864 KB Output is correct
20 Correct 3 ms 1012 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 608 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Correct 2 ms 628 KB Output is correct
12 Correct 2 ms 680 KB Output is correct
13 Correct 2 ms 832 KB Output is correct
14 Correct 2 ms 832 KB Output is correct
15 Correct 2 ms 832 KB Output is correct
16 Correct 2 ms 832 KB Output is correct
17 Correct 3 ms 836 KB Output is correct
18 Correct 2 ms 864 KB Output is correct
19 Correct 2 ms 864 KB Output is correct
20 Correct 3 ms 1012 KB Output is correct
21 Correct 3 ms 1012 KB Output is correct
22 Correct 6 ms 1144 KB Output is correct
23 Correct 10 ms 1428 KB Output is correct
24 Correct 20 ms 2156 KB Output is correct
25 Correct 88 ms 5788 KB Output is correct
26 Correct 20 ms 6776 KB Output is correct
27 Correct 64 ms 9712 KB Output is correct
28 Correct 67 ms 12940 KB Output is correct
29 Correct 132 ms 19080 KB Output is correct
30 Correct 182 ms 27780 KB Output is correct
31 Correct 90 ms 31456 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 608 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Correct 2 ms 628 KB Output is correct
12 Correct 2 ms 680 KB Output is correct
13 Correct 2 ms 832 KB Output is correct
14 Correct 2 ms 832 KB Output is correct
15 Correct 2 ms 832 KB Output is correct
16 Correct 2 ms 832 KB Output is correct
17 Correct 3 ms 836 KB Output is correct
18 Correct 2 ms 864 KB Output is correct
19 Correct 2 ms 864 KB Output is correct
20 Correct 3 ms 1012 KB Output is correct
21 Correct 3 ms 1012 KB Output is correct
22 Correct 6 ms 1144 KB Output is correct
23 Correct 10 ms 1428 KB Output is correct
24 Correct 20 ms 2156 KB Output is correct
25 Correct 88 ms 5788 KB Output is correct
26 Correct 20 ms 6776 KB Output is correct
27 Correct 64 ms 9712 KB Output is correct
28 Correct 67 ms 12940 KB Output is correct
29 Correct 132 ms 19080 KB Output is correct
30 Correct 182 ms 27780 KB Output is correct
31 Correct 90 ms 31456 KB Output is correct
32 Correct 76 ms 36060 KB Output is correct
33 Correct 99 ms 40688 KB Output is correct
34 Correct 158 ms 49648 KB Output is correct
35 Correct 140 ms 56280 KB Output is correct
36 Correct 162 ms 64608 KB Output is correct
37 Correct 192 ms 74232 KB Output is correct
38 Correct 188 ms 84032 KB Output is correct
39 Correct 217 ms 95656 KB Output is correct
40 Correct 213 ms 106640 KB Output is correct