제출 #1153475

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1153475		MPG	Reconstruction Project (JOI22_reconstruction)	C++20	0 / 100	5043 ms	17448 KiB

reconstruction

//#pragma GCC optomize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2") 



#include <bits/stdc++.h>
using namespace std;
typedef long long                           ll;
#define                                     max_heap priority_queue<pair <ll, pair <ll, ll>>>
#define                                     min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>>
//#define                                     min_heap priority_queue<ll, vector<ll>, greater<ll>>
#define                                     sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define                                     filE freopen("in.txt", "r", stdin); freopen("out1.txt", "w", stdout); 
#define                                     endl '\n'
#define                                     md(a) (a % mod + mod) % mod
#define pb push_back
//cout << vectorprecision(5) << fixed << f;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll const maxn = 2e5 + 123;
ll const inf = 2e18;
ll const loG = 23;
//ll const mod = 1e9 + 7;
ll const mod = 998244353;
ll const sq = 350;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}



ll n, m, q;
vector <ll> yal[maxn];



void Solve(){

cin >> n >> m;
for (int i = 1; i < m + 1; i++){
    ll a, b, c; cin >> a >> b >> c;
    yal[min(a, b)].push_back(c);
}
for (int i = 1; i < n; i++){
    sort(yal[i].begin(), yal[i].end()); yal[i].resize(unique(yal[i].begin(), yal[i].end()) - yal[i].begin());
}
cin >> q;
while (q--){
    ll x; cin >> x;
    ll ans = 0;
    for (int i = 1; i < n; i++){
        ll ind = lower_bound(yal[i].begin(), yal[i].end(), x) - yal[i].begin();
        ll r = ind, l = ind - 1, k = ind + 1;
        ll mn = inf;
        ll y;
        if ((r < yal[i].size()) && (r > -1)){
            y = x - yal[i][r];
            if (y < 0)
                y = -y;
            mn = min(mn, y);
        }
        if ((l > -1) && (l < yal[i].size())){
            y = x - yal[i][l];
            if (y < 0)
                y = -y;
            mn = min(mn, y);
        }
        //cout << i << " " << l << " " << r << " " << mn << endl;
        ans += mn;
    }
    cout << ans << endl;
}



}



int main(){
sariE;// filE;



int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 4
• Subtask 3: 0 / 7
• Subtask 4: 0 / 28
• Subtask 5: 0 / 35
• Subtask 6: 0 / 23