Submission #1005506

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1005506	2024-06-22T14:00:10 Z	HishamAlshehri	Party (POI11_imp)	C++17	100 / 100	401 ms	9300 KB

#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.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	604 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2652 KB	Output is correct
2	Correct	10 ms	2652 KB	Output is correct
3	Correct	9 ms	2652 KB	Output is correct
4	Correct	9 ms	2652 KB	Output is correct
5	Correct	9 ms	2688 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	2648 KB	Output is correct
2	Correct	37 ms	4700 KB	Output is correct
3	Correct	35 ms	4728 KB	Output is correct
4	Correct	36 ms	4696 KB	Output is correct
5	Correct	36 ms	4696 KB	Output is correct

Subtask #4
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	2648 KB	Output is correct
2	Correct	94 ms	6748 KB	Output is correct
3	Correct	86 ms	6748 KB	Output is correct
4	Correct	86 ms	6748 KB	Output is correct
5	Correct	85 ms	6784 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	30 ms	4700 KB	Output is correct
2	Correct	122 ms	6744 KB	Output is correct
3	Correct	132 ms	6768 KB	Output is correct
4	Correct	125 ms	6784 KB	Output is correct
5	Correct	127 ms	6764 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	84 ms	6748 KB	Output is correct
2	Correct	149 ms	6748 KB	Output is correct
3	Correct	152 ms	6748 KB	Output is correct
4	Correct	154 ms	6748 KB	Output is correct
5	Correct	155 ms	6784 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	157 ms	6764 KB	Output is correct
2	Correct	207 ms	8832 KB	Output is correct
3	Correct	213 ms	8796 KB	Output is correct
4	Correct	209 ms	8820 KB	Output is correct
5	Correct	225 ms	8836 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	206 ms	8832 KB	Output is correct
2	Correct	289 ms	8792 KB	Output is correct
3	Correct	264 ms	8832 KB	Output is correct
4	Correct	262 ms	8796 KB	Output is correct
5	Correct	245 ms	8792 KB	Output is correct

Subtask #9
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	233 ms	8792 KB	Output is correct
2	Correct	293 ms	8796 KB	Output is correct
3	Correct	293 ms	8796 KB	Output is correct
4	Correct	321 ms	8832 KB	Output is correct
5	Correct	314 ms	8792 KB	Output is correct

Subtask #10
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	304 ms	8816 KB	Output is correct
2	Correct	370 ms	8944 KB	Output is correct
3	Correct	344 ms	8976 KB	Output is correct
4	Correct	356 ms	9040 KB	Output is correct
5	Correct	335 ms	8968 KB	Output is correct

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	350 ms	9244 KB	Output is correct
2	Correct	390 ms	9300 KB	Output is correct
3	Correct	374 ms	9296 KB	Output is correct
4	Correct	395 ms	9244 KB	Output is correct
5	Correct	401 ms	9296 KB	Output is correct

Submission #1005506

Compilation message