| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 869681 |
2023-11-05T10:07:26 Z |
TB_ |
Džumbus (COCI19_dzumbus) |
C++17 |
|
34 ms |
13956 KB |
#include <bits/stdc++.h>
using namespace std;
// #undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
// #pragma GCC target("movbe") // byte swap
// #pragma GCC target("aes,pclmul,rdrnd") // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define INF (ll)1e16+7
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << (x) << endl;
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
vl cost(2001);
vvl adj(2001);
vl res[2001][3];
int seen[2001];
void solve(int u, int last = -1){
seen[u] = 1;
res[u][0] = {0};
res[u][1] = {INF};
for(auto &v : adj[u]){
if(v==last || seen[v]) continue;
solve(v, u);
vl next(max(res[u][0].size(), res[u][1].size()) * max(res[v][0].size(), res[v][1].size())+2, INF);
vl next2(max(res[u][0].size()*res[v][0].size(), res[u][0].size()*res[v][1].size())+2, INF);
fo(i, res[u][1].size()){
fo(j, res[v][1].size()){
next[i+j] = min(next[i+j], res[u][1][i]+res[v][1][j]);
}
fo(j, res[v][0].size()){
next[i+j+1] = min(next[i+j+1], res[u][1][i]+res[v][0][j]+cost[v]);
next[i+j] = min(next[i+j], res[u][1][i]+res[v][0][j]);
}
}
fo(i, res[u][0].size()){
fo(j, res[v][1].size()){
next2[i+j] = min(next2[i+j], res[u][0][i]+res[v][1][j]);
next[i+j+1] = min(next[i+j+1], res[u][0][i]+res[v][1][j]+cost[u]);
}
fo(j, res[v][0].size()){
next2[i+j] = min(next2[i+j], res[u][0][i]+res[v][0][j]);
next[i+j+2] = min(next[i+j+2], res[u][0][i]+res[v][0][j]+cost[u]+cost[v]);
}
}
while(next[next.size()-1] == INF) next.pop_back();
while(next2[next2.size()-1] == INF) next2.pop_back();
swap(res[u][0], next2);
swap(res[u][1], next);
}
}
int main() {
// cout << fixed << setprecision(20);
// auto start = std::chrono::steady_clock::now(); // since(start).count()
cin.tie(0)->sync_with_stdio(0);
int n, m, q, val, from, to;
cin >> n >> m;
fo(i, n) cin >> cost[i];
fo(i, m){
cin >> from >> to;
adj[--from].pb(--to);
adj[to].pb(from);
}
memset(seen, 0, sizeof(seen));
fo(i, n) adj[1500].pb(i);
cost[1500] = INF;
solve(1500);
res[1500][0][1] = res[1500][0][2];
cin >> q;
vpl queries;
fo(i, q){
cin >> val;
queries.pb({val, i});
}
vpl ans;
sort(all(queries));
int index = 0;
fo(i, res[1500][0].size()){
while(index < q && queries[index].F<res[1500][0][i]){
ans.pb({queries[index++].S, i-1});
}
}
while(index < q){
ans.pb({queries[index++].S, res[1500][0].size()-1});
}
sort(all(ans));
fo(i, q) cout << ans[i].S << "\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
8812 KB |
Output is correct |
| 2 |
Incorrect |
10 ms |
8804 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
8812 KB |
Output is correct |
| 2 |
Incorrect |
10 ms |
8804 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
11592 KB |
Output is correct |
| 2 |
Incorrect |
34 ms |
13956 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
8812 KB |
Output is correct |
| 2 |
Incorrect |
10 ms |
8804 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
