# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29349 | tlwpdus | Untitled (POI11_imp) | C++11 | 1676 ms | 39560 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |