# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
912342 | Alish | Reconstruction Project (JOI22_reconstruction) | C++17 | 5019 ms | 17524 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define pb push_back
#define F first
#define S second
#define fast_io ios::sync_with_stdio(false); cout.tie(0); cin.tie(0);
#define debug(x) cerr<<#x<<" "<<x<<endl;
#define endl '\n'
const int N = 523;
const int INF=1e9+23;
vector<int> E[N]; // i-> i+1 : weights
int n, m, q;
int main()
{
fast_io
cin>>n>>m;
for (int i=0; i<m; i++){
int v, u, w;
cin>>v>>u>>w;
E[min(u, v)].pb(w);
if(abs(v-u)!=1) assert(0);
}
for (int i=0; i<=n; i++) sort(all(E[i]));
cin>>q;
while(q--){
ll wi; cin>>wi;
ll ans=0;
for (int i=1; i<n; i++){
int t=lower_bound(all(E[i]), wi)-E[i].begin();
ll temp=INF;
if(t<E[i].size()) temp=min(temp, abs(wi-E[i][t]));
t--;
if(t>=0) temp=min(temp, abs(wi-E[i][t]));
ans+=temp;
}
cout<<ans<<endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |