oj.uz

Submission #29347

# Submission time Handle Problem Language Result Execution time Memory
29347 2017-07-19T03:24:23 Z tlwpdus Party (POI11_imp) C++11
9 / 100
 1539 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;
		}
    }
    for (i=0;i<n;i++) {
		if (!die[i]) printf("%d ",i+1);
    }
    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
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 39560 KB Output is correct
2 Incorrect 36 ms 39560 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 39560 KB Output is correct
2 Incorrect 139 ms 39560 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 39560 KB Output is correct
2 Incorrect 366 ms 39560 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 39560 KB Output is correct
2 Incorrect 573 ms 39560 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 39560 KB Output is correct
2 Incorrect 733 ms 39560 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 646 ms 39560 KB Output is correct
2 Incorrect 933 ms 39560 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 779 ms 39560 KB Output is correct
2 Incorrect 1089 ms 39560 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 926 ms 39560 KB Output is correct
2 Incorrect 1269 ms 39560 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1159 ms 39560 KB Output is correct
2 Incorrect 1323 ms 39560 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1369 ms 39560 KB Output is correct
2 Incorrect 1539 ms 39560 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -