제출 #311472

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
311472		AlexLuchianov	무제 (POI11_imp)	C++14	72 / 100	3081 ms	62968 KiB

Main

#include <iostream>
#include <vector>

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((b) < (a)) ? (b) : (a))

int const nmax = 3000;
int mat[1 + nmax][1 + nmax];
int sol[1 + nmax];

int main() {
  int n, m;
  std::cin >> n >> m;
  for(int i = 1; i <= n; i++)
    mat[i][i] = 1;
  for(int i = 1; i <= m; i++) {
    int x, y;
    std::cin >> x >> y;
    mat[x][y] = mat[y][x] = 1;
  }
  for(int i = 1; i <= n; i++)
    sol[i] = 1;

  for(int i = 1;i <= n; i++)
    for(int j = 1;j <= n; j++)
      if(mat[i][j] == 0 && sol[i] + sol[j] == 2)
        sol[i] = sol[j] = 0;
  int _count = 0;
  for(int i = 1;i <= n; i++)
    if(_count < n / 3 && sol[i] == 1) {
      std::cout << i << " ";
      _count++;
    }
  return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10