Submission #1005507

#	Time	Username	Problem	Language	Result	Execution time	Memory
1005507		vjudge1	Untitled (POI11_imp)	C++17	100 / 100	343 ms	9444 KiB

Main

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

using namespace std;
// using namespace __gnu_pbds;

#define int long long
#define mod 1000000007
#define base 7001
#define base2 757
// #define pi acos(-1)
#define double long double
// #define ordered_set tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>

#pragma GCC optimize("O3,Ofast,unroll-loops")
#pragma GCC target("avx2,sse3,sse4,avx")

constexpr int maxn = 3001;
const int N = 1 << (int)(ceil(log2(maxn)));

int n, m;
bool adj[maxn][maxn];

signed main()
{
    cin.tie(0) -> sync_with_stdio(0);
    cin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y;
        cin >> x >> y;
        adj[x][y] = 1;
        adj[y][x] = 1;
    }
    set<int>s;
    for (int i = 0; i < n; i++)
        s.insert(i + 1);
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (i != j && !adj[i][j] && s.find(i) != s.end() && s.find(j) != s.end())
            {
                s.erase(i);
                s.erase(j);
            }
        }
    }
    int cnt = 0;
    for (auto i : s)
    {
        if (cnt >= n / 3)
            return 0;
        cout << i << " ";
        cnt++;
    }
}

• 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