oj.uz

Submission #29349

# Submission time Handle Problem Language Result Execution time Memory
29349 2017-07-19T03:26:56 Z tlwpdus Party (POI11_imp) C++11
100 / 100
 1676 ms 39560 KB 
#include <bits/stdc++.h>

using namespace std;

int n, m;
int mat[3100][3100];
bool die[3100];

int main() {
    int i, j;

    scanf("%d%d",&n,&m);
    for (i=0;i<m;i++) {
		int a, b;
		scanf("%d%d",&a,&b); --a; --b;
		mat[a][b] = mat[b][a] = 1;
    }
    for (i=0;i<n;i++) {
		for (j=0;j<n;j++) {
			if (i==j) continue;
			if (die[i]||die[j]) continue;
			if (!mat[i][j]) die[i] = die[j] = 1;
		}
    }
    int cnt = 0;
    for (i=0;i<n;i++) {
		if (!die[i]) {
			printf("%d ",i+1);
			cnt++;
		}
		if (cnt==n/3) break;
    }
    printf("\n");

    return 0;
}

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 39560 KB Output is correct
2 Correct 0 ms 39560 KB Output is correct
3 Correct 0 ms 39560 KB Output is correct
4 Correct 0 ms 39560 KB Output is correct
5 Correct 0 ms 39560 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 39560 KB Output is correct
2 Correct 33 ms 39560 KB Output is correct
3 Correct 19 ms 39560 KB Output is correct
4 Correct 26 ms 39560 KB Output is correct
5 Correct 26 ms 39560 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 39560 KB Output is correct
2 Correct 106 ms 39560 KB Output is correct
3 Correct 133 ms 39560 KB Output is correct
4 Correct 163 ms 39560 KB Output is correct
5 Correct 156 ms 39560 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 39560 KB Output is correct
2 Correct 346 ms 39560 KB Output is correct
3 Correct 343 ms 39560 KB Output is correct
4 Correct 379 ms 39560 KB Output is correct
5 Correct 383 ms 39560 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 39560 KB Output is correct
2 Correct 546 ms 39560 KB Output is correct
3 Correct 529 ms 39560 KB Output is correct
4 Correct 436 ms 39560 KB Output is correct
5 Correct 579 ms 39560 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 39560 KB Output is correct
2 Correct 553 ms 39560 KB Output is correct
3 Correct 753 ms 39560 KB Output is correct
4 Correct 483 ms 39560 KB Output is correct
5 Correct 683 ms 39560 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 599 ms 39560 KB Output is correct
2 Correct 1018 ms 39560 KB Output is correct
3 Correct 886 ms 39560 KB Output is correct
4 Correct 893 ms 39560 KB Output is correct
5 Correct 939 ms 39560 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 776 ms 39560 KB Output is correct
2 Correct 1046 ms 39560 KB Output is correct
3 Correct 1033 ms 39560 KB Output is correct
4 Correct 1093 ms 39560 KB Output is correct
5 Correct 1109 ms 39560 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 929 ms 39560 KB Output is correct
2 Correct 1286 ms 39560 KB Output is correct
3 Correct 1243 ms 39560 KB Output is correct
4 Correct 1233 ms 39560 KB Output is correct
5 Correct 1299 ms 39560 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1093 ms 39560 KB Output is correct
2 Correct 1483 ms 39560 KB Output is correct
3 Correct 1346 ms 39560 KB Output is correct
4 Correct 1323 ms 39560 KB Output is correct
5 Correct 1513 ms 39560 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1399 ms 39560 KB Output is correct
2 Correct 1589 ms 39560 KB Output is correct
3 Correct 1676 ms 39560 KB Output is correct
4 Correct 1593 ms 39560 KB Output is correct
5 Correct 1546 ms 39560 KB Output is correct