oj.uz

Submission #226369

# Submission time Handle Problem Language Result Execution time Memory
226369 2020-04-23T14:33:15 Z DodgeBallMan Party (POI11_imp) C++14
100 / 100
 1221 ms 65536 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 3e3 + 10;
int n, m, edge[N][N], inv[N];

int main()
{
    fill( inv, inv + N, 1 );
    scanf("%d %d",&n,&m);
    for( int i = 1, a, b ; i <= m ; i++ ) {
        scanf("%d %d",&a,&b);
        edge[a][b] = edge[b][a] = 1;
    }
    for( int i = 1 ; i <= n ; i++ ) {
        for( int j = i + 1 ; j <= n ; j++ ) {
            if( !edge[i][j] && inv[i] && inv[j] ) inv[i] = inv[j] = 0;
        }
    }
    int cnt = 0;
    for( int i = 1 ; i <= n && cnt < n / 3 ; i++ ) {
        if( inv[i] ) {
            printf("%d ",i);
            cnt++;
        }
    }
    return 0;
}

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 6 ms 768 KB Output is correct
4 Correct 6 ms 768 KB Output is correct
5 Correct 5 ms 768 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1280 KB Output is correct
2 Correct 26 ms 3968 KB Output is correct
3 Correct 26 ms 3968 KB Output is correct
4 Correct 26 ms 3960 KB Output is correct
5 Correct 27 ms 3968 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2560 KB Output is correct
2 Correct 106 ms 11232 KB Output is correct
3 Correct 101 ms 11128 KB Output is correct
4 Correct 103 ms 11128 KB Output is correct
5 Correct 102 ms 11128 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 4096 KB Output is correct
2 Correct 268 ms 22392 KB Output is correct
3 Correct 262 ms 22136 KB Output is correct
4 Correct 271 ms 22392 KB Output is correct
5 Correct 264 ms 22392 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 7164 KB Output is correct
2 Correct 412 ms 31096 KB Output is correct
3 Correct 404 ms 30840 KB Output is correct
4 Correct 405 ms 30968 KB Output is correct
5 Correct 416 ms 31224 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 15096 KB Output is correct
2 Correct 499 ms 37368 KB Output is correct
3 Correct 529 ms 37156 KB Output is correct
4 Correct 513 ms 37240 KB Output is correct
5 Correct 534 ms 37240 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 24056 KB Output is correct
2 Correct 723 ms 45904 KB Output is correct
3 Correct 717 ms 45420 KB Output is correct
4 Correct 709 ms 45536 KB Output is correct
5 Correct 711 ms 45560 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 609 ms 27752 KB Output is correct
2 Correct 834 ms 51572 KB Output is correct
3 Correct 844 ms 51208 KB Output is correct
4 Correct 821 ms 51320 KB Output is correct
5 Correct 818 ms 51448 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 717 ms 29816 KB Output is correct
2 Correct 950 ms 57844 KB Output is correct
3 Correct 978 ms 57588 KB Output is correct
4 Correct 987 ms 57720 KB Output is correct
5 Correct 968 ms 57464 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 851 ms 32220 KB Output is correct
2 Correct 1150 ms 64116 KB Output is correct
3 Correct 1137 ms 63604 KB Output is correct
4 Correct 1124 ms 64008 KB Output is correct
5 Correct 1117 ms 63864 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1061 ms 35832 KB Output is correct
2 Correct 1208 ms 65536 KB Output is correct
3 Correct 1221 ms 65536 KB Output is correct
4 Correct 1202 ms 65536 KB Output is correct
5 Correct 1219 ms 65536 KB Output is correct