제출 #681849

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681849		vjudge1	Pipes (BOI13_pipes)	C++17	44.07 / 100	103 ms	19556 KiB

pipes

// header file
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// macros
#define endl "\n"
#define ll long long
#define mp make_pair
#define ins insert
#define lb lower_bound
#define pb push_back
#define ub upper_bound
#define lll __int128
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int lim = 1e5 + 5;
int a[lim];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    // (x + y - z) / 2
    int n, m;
    cin >> n >> m;
    ll tot = 0;
    for(int i = 1; i <= n; ++i)
        cin >> a[i], tot += a[i];
    pair<pair<int, int>, ll> adj[m + 1];
    ll cs[n + 1];
    memset(cs, 0, sizeof(cs));
    vector<ll> res;
    for(int i = 1; i <= m; ++i) {
        int x, y;
        cin >> x >> y;    
        ll tmp = (2 * (a[x] + a[y]) - tot) / 2;
        res.pb(tmp);
        cs[x] += tmp;
        cs[y] += tmp;
    }
    bool ans = 1;
    for(int i = 1; i <= n; ++i)
        ans &= (cs[i] == a[i]);
    if(ans) {
        for(auto i : res)
            cout << 2 * i << endl;
    }
    else {
        cout << 0 << endl;
    }
    return 0;
}

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

pipes.cpp: In function 'int main()':
pipes.cpp:33:30: warning: unused variable 'adj' [-Wunused-variable]
   33 |     pair<pair<int, int>, ll> adj[m + 1];
      |                              ^~~

• Subtask 1: 0 / 30
• Subtask 2: 44.074074074074076 / 70