제출 #1086433

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1086433		steveonalex	Stranded Far From Home (BOI22_island)	C++17	100 / 100	230 ms	49392 KiB

island

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct DSU{
    int n;
    vector<int> parent, sz;
    vector<ll> sum;

    DSU(int _n){
        n = _n;
        parent.resize(n+1); sz.resize(n+1, 1);
        sum.resize(n+1);
        for(int i = 1; i<=n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}

    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];
            sum[u] += sum[v];
            return true;
        }
        return false;
    }

    int get_size(int u){return sz[find_set(u)];}
    ll get_sum(int u){return sum[find_set(u)];}
};

const int N = 2e5 + 69;
int n, m;
int a[N];
vector<int> graph[N];

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    cin >> n >> m;
    for(int i = 1; i<=n; ++i) cin >> a[i];
    for(int i = 0; i<m; ++i){
        int u, v; cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }

    vector<int> val;
    for(int i = 1; i<=n; ++i) val.push_back(a[i]);
    remove_dup(val);

    int k = val.size();
    vector<vector<int>> ver(k);
    vector<vector<pair<int, ll>>> queries(k);
    for(int i = 1; i<=n; ++i){
        int idx = lower_bound(ALL(val), a[i]) - val.begin();
        ver[idx].push_back(i);
        queries[idx].push_back({i, a[i]});
    }

    DSU mst(n);
    for(int i = 1; i<=n; ++i) mst.sum[i] = a[i];

    vector<ll> ans(n+1);
    for(int i = 0; i< val.size(); ++i){
        for(int u: ver[i]){
            for(int v: graph[u]) if (a[v] <= a[u]) mst.join_set(u, v);
        }

        while(queries[i].size()){
            pair<int, ll> cur = queries[i].back(); queries[i].pop_back();
            ans[cur.first] = cur.second;
            ll sigma = mst.get_sum(cur.first);
            if (sigma > cur.second){
                int idx = upper_bound(ALL(val), sigma) - val.begin() - 1;
                queries[idx].push_back({cur.first, sigma});
            }
        }
    }   


    string s;
    for(int i = 1; i<=n; ++i) if (ans[i] == mst.get_sum(i)) s.push_back('1');
    else s.push_back('0');

    cout << s << "\n"; 

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

island.cpp: In function 'int main()':
island.cpp:120:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for(int i = 0; i< val.size(); ++i){
      |                    ~^~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 30 / 30
• Subtask 5: 35 / 35