Submission #1005511

#	Time	Username	Problem	Language	Result	Execution time	Memory
1005511		basa	Untitled (POI11_imp)	C++14	100 / 100	371 ms	9304 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int maxn = 3005;

bool adj[maxn][maxn];

signed main()
{
  cin.tie(0) -> sync_with_stdio(0);
  int n, m;
  cin >> n >> m;

  for(int i = 0; i < m; i++){
    int u, v;
    cin >> u >> v;

    adj[u][v] = 1;
    adj[v][u] = 1;
  }

  bool skip[n + 5] = {};
  for(int i = 1; i <= n; i++){
    for(int j = 1; j <= n; j++){
      if(skip[i] || skip[j] || i == j) continue;

      if(!adj[i][j]){
        skip[i] = 1;
        skip[j] = 1;
        break;
      }
    }
  }

  int t = 0;
  vector<int>ans;
  for(int i = 1; i <= n && t < n / 3; i++){
    if(skip[i]) continue;

    t++;
    ans.push_back(i);
  }

  for(int i : ans) cout << i << ' ';
}

• 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: 9 / 9
• Subtask 10: 9 / 9
• Subtask 11: 10 / 10