oj.uz

Submission #1005504

# Submission time Handle Problem Language Result Execution time Memory
1005504 2024-06-22T13:58:11 Z HishamAlshehri Party (POI11_imp) C++17
9 / 100
 359 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);
            }
        }
    }
    for (auto i : s)
        cout << i << " ";
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 412 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Incorrect 9 ms 2648 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2652 KB Output is correct
2 Incorrect 32 ms 4696 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2648 KB Output is correct
2 Incorrect 98 ms 6768 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 4716 KB Output is correct
2 Incorrect 125 ms 6748 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 6744 KB Output is correct
2 Incorrect 150 ms 6744 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 6996 KB Output is correct
2 Incorrect 200 ms 8820 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 8792 KB Output is correct
2 Incorrect 255 ms 8836 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 8792 KB Output is correct
2 Incorrect 271 ms 8792 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 8796 KB Output is correct
2 Incorrect 318 ms 9040 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 9264 KB Output is correct
2 Incorrect 359 ms 9300 KB Wypisano za du¿o osób
3 Halted 0 ms 0 KB -