Submission #328603

#	Time	Username	Problem	Language	Result	Execution time	Memory
328603		Vladth11	무제 (POI11_imp)	C++14	0 / 100	3098 ms	65536 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define debug(x) cerr << #x << " " << x << "\n"
#define debug_with_space(x) cerr << #x << " " << x << " "

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <ll, pii> piii;
typedef tree <pii, null_type, less <pii>, rb_tree_tag, tree_order_statistics_node_update> OST;

const ll NMAX = 200001;
const ll INF = (1 << 16) - 1;
const ll MOD = 1000000007;
const ll BLOCK = 101;
const ll nr_of_bits = 20;

bitset <3001> b[3001];
vector <int> sol;
vector <int> v[3001];

int main()
{
    int n, m, i;
    cin >> n >> m;
    for(i = 1; i <= m; i++){
        int x, y;
        cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
        b[x][y].flip();
        b[y][x].flip();
    }
    while(1){
        int nod = rand() % (n - 1) + 1;
        int cnt = 1;
        sol.clear();
        sol.push_back(nod);
        while(cnt < (n / 3)){
            for(auto x : v[nod]){
                if((b[nod] & b[x]).count() >= 2 * (n / 3) - 2){
                    nod = x;
                    sol.push_back(x);
                    cnt++;
                    break;
                }
            }
            break;
        }
        if(cnt == n / 3)
        {
            sort(sol.begin(), sol.end());
            for(auto x : sol){
                cout << x << " ";
            }
            return 0;
        }
    }
    return 0;
}

Compilation message (stderr)

imp.cpp: In function 'int main()':
imp.cpp:43:44: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |                 if((b[nod] & b[x]).count() >= 2 * (n / 3) - 2){
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~

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