Submission #1077730

#TimeUsernameProblemLanguageResultExecution timeMemory
1077730vjudge1Reconstruction Project (JOI22_reconstruction)C++17
7 / 100
1599 ms49680 KiB
#include <bits/stdc++.h> #define F first #define S second #define pb push_back #define ppb pop_back #define ep insert #define endl '\n' #define elif else if #define pow pwr #define sqrt sqrtt #define int long long #define ll long long typedef unsigned long long ull; using namespace std; const int N=505,M=1e5+5,Q=1e6+5; int n,m,j[N],q,ans[Q]; vector<int> adj[N]; pair<int,int> w[Q]; int32_t main(){ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); cin>>n>>m; for (int i=1;i<=m;i++){ int x,y,w; cin>>x>>y>>w; adj[x].pb(w); } for (int i=1;i<n;i++) sort(adj[i].begin(),adj[i].end()),j[i]=0; cin>>q; for (int i=1;i<=q;i++) cin>>w[i].F,w[i].S=i; sort(w+1,w+1+q); for (int i=1;i<=q;i++){ for (int k=1;k<n;k++){ while (j[k]+1<adj[k].size()){ if (abs(w[i].F-adj[k][j[k]+1])<abs(w[i].F-adj[k][j[k]])) j[k]++; else break; } ans[w[i].S]+=abs(w[i].F-adj[k][j[k]]); } } for (int i=1;i<=q;i++) cout<<ans[i]<<endl; return 0; }

Compilation message (stderr)

reconstruction.cpp: In function 'int32_t main()':
reconstruction.cpp:33:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |    while (j[k]+1<adj[k].size()){
      |           ~~~~~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...