oj.uz

Submission #228145

# Submission time Handle Problem Language Result Execution time Memory
228145 2020-04-30T04:15:44 Z caoash Race (IOI11_race) C++14
100 / 100
 551 ms 74872 KB 
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include "race.h"
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset
 
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
 
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
 
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
 
template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};
 
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
 
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }
 
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}
 
using namespace input;
 
namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}
 
using namespace output;
 
namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}
 
using namespace io;
 
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
 
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);
vector<pair<int,ll>> adj[MX]; map<ll,ll> sack[MX]; ll K; ll ans = INT_MAX; 
 
void dfs(int v, int p, ll d, ll dist){
  for(pi to : adj[v]){
   if(to.f != p){
      dfs(to.f, v, d+1, dist + to.s);
      if(sz(sack[v]) < sz(sack[to.f])){
         swap(sack[v], sack[to.f]);
      }
      //dbg(to.f, sack[to.f]);
      trav(x, sack[to.f]){
        if(sack[v].count(dist+(K-(x.f-dist)))){
         ckmin(ans, abs(sack[v][dist+(K-(x.f-dist))] + sack[to.f][x.f])-(2*d));
        }
        if((x.f-dist) == K){
         ckmin(ans, x.s-d);
        }
      }
      trav(x, sack[to.f]){
        if(sack[v].count(x.f)){
           ckmin(sack[v][x.f], sack[to.f][x.f]);
        }
        else{
           sack[v][x.f] = sack[to.f][x.f];
        }
      }
      sack[to.f].clear();
    }
  }
  sack[v][dist] = d;
  if(sack[v].count(dist+K)){
   ckmin(ans, sack[v][dist+K]-d);
  }
}
 
int best_path(int N, int nK, int H[][2], int L[]){
   K = (ll)nK;
   fax(i,N-1){
      int u = H[i][0]; int v = H[i][1]; ll w = (ll)L[i];
      adj[u].pb({v,w}); adj[v].pb({u,w});
   }
   dfs(0,-1, 0, 0);
   trav(curr, sack[0]){
      if(curr.f == K){
         ckmin(ans, curr.s);
      }
   }
   return (ans == INT_MAX ? -1 : ans);
}

/*
int main() {
   setIO(); 
   int N,K; re(N,K);
   int H[N][2];
   int L[N];
   fax(i,N-1){
     re(H[i][0], H[i][1], L[i]); 
   }
   pr(best_path(N,K,H,L), "\n");
}
*/

Compilation message

race.cpp: In function 'void io::setIn(std::__cxx11::string)':
race.cpp:134:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
race.cpp: In function 'void io::setOut(std::__cxx11::string)':
race.cpp:135:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14464 KB Output is correct
5 Correct 13 ms 14336 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 12 ms 14464 KB Output is correct
8 Correct 13 ms 14464 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 13 ms 14464 KB Output is correct
11 Correct 13 ms 14464 KB Output is correct
12 Correct 13 ms 14464 KB Output is correct
13 Correct 12 ms 14464 KB Output is correct
14 Correct 13 ms 14464 KB Output is correct
15 Correct 13 ms 14464 KB Output is correct
16 Correct 13 ms 14464 KB Output is correct
17 Correct 13 ms 14464 KB Output is correct
18 Correct 12 ms 14464 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14464 KB Output is correct
5 Correct 13 ms 14336 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 12 ms 14464 KB Output is correct
8 Correct 13 ms 14464 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 13 ms 14464 KB Output is correct
11 Correct 13 ms 14464 KB Output is correct
12 Correct 13 ms 14464 KB Output is correct
13 Correct 12 ms 14464 KB Output is correct
14 Correct 13 ms 14464 KB Output is correct
15 Correct 13 ms 14464 KB Output is correct
16 Correct 13 ms 14464 KB Output is correct
17 Correct 13 ms 14464 KB Output is correct
18 Correct 12 ms 14464 KB Output is correct
19 Correct 12 ms 14464 KB Output is correct
20 Correct 13 ms 14464 KB Output is correct
21 Correct 13 ms 14464 KB Output is correct
22 Correct 14 ms 14560 KB Output is correct
23 Correct 14 ms 14592 KB Output is correct
24 Correct 14 ms 14592 KB Output is correct
25 Correct 14 ms 14592 KB Output is correct
26 Correct 14 ms 14592 KB Output is correct
27 Correct 13 ms 14464 KB Output is correct
28 Correct 14 ms 14592 KB Output is correct
29 Correct 14 ms 14592 KB Output is correct
30 Correct 14 ms 14592 KB Output is correct
31 Correct 15 ms 14592 KB Output is correct
32 Correct 14 ms 14592 KB Output is correct
33 Correct 14 ms 14592 KB Output is correct
34 Correct 14 ms 14592 KB Output is correct
35 Correct 14 ms 14720 KB Output is correct
36 Correct 14 ms 14592 KB Output is correct
37 Correct 13 ms 14592 KB Output is correct
38 Correct 14 ms 14592 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14464 KB Output is correct
5 Correct 13 ms 14336 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 12 ms 14464 KB Output is correct
8 Correct 13 ms 14464 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 13 ms 14464 KB Output is correct
11 Correct 13 ms 14464 KB Output is correct
12 Correct 13 ms 14464 KB Output is correct
13 Correct 12 ms 14464 KB Output is correct
14 Correct 13 ms 14464 KB Output is correct
15 Correct 13 ms 14464 KB Output is correct
16 Correct 13 ms 14464 KB Output is correct
17 Correct 13 ms 14464 KB Output is correct
18 Correct 12 ms 14464 KB Output is correct
19 Correct 124 ms 20728 KB Output is correct
20 Correct 137 ms 20728 KB Output is correct
21 Correct 121 ms 20728 KB Output is correct
22 Correct 135 ms 20856 KB Output is correct
23 Correct 175 ms 21368 KB Output is correct
24 Correct 131 ms 20344 KB Output is correct
25 Correct 94 ms 30072 KB Output is correct
26 Correct 66 ms 37624 KB Output is correct
27 Correct 204 ms 27768 KB Output is correct
28 Correct 273 ms 72952 KB Output is correct
29 Correct 272 ms 71416 KB Output is correct
30 Correct 211 ms 27768 KB Output is correct
31 Correct 217 ms 27896 KB Output is correct
32 Correct 252 ms 27896 KB Output is correct
33 Correct 233 ms 27128 KB Output is correct
34 Correct 413 ms 39776 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14464 KB Output is correct
5 Correct 13 ms 14336 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 12 ms 14464 KB Output is correct
8 Correct 13 ms 14464 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 13 ms 14464 KB Output is correct
11 Correct 13 ms 14464 KB Output is correct
12 Correct 13 ms 14464 KB Output is correct
13 Correct 12 ms 14464 KB Output is correct
14 Correct 13 ms 14464 KB Output is correct
15 Correct 13 ms 14464 KB Output is correct
16 Correct 13 ms 14464 KB Output is correct
17 Correct 13 ms 14464 KB Output is correct
18 Correct 12 ms 14464 KB Output is correct
19 Correct 12 ms 14464 KB Output is correct
20 Correct 13 ms 14464 KB Output is correct
21 Correct 13 ms 14464 KB Output is correct
22 Correct 14 ms 14560 KB Output is correct
23 Correct 14 ms 14592 KB Output is correct
24 Correct 14 ms 14592 KB Output is correct
25 Correct 14 ms 14592 KB Output is correct
26 Correct 14 ms 14592 KB Output is correct
27 Correct 13 ms 14464 KB Output is correct
28 Correct 14 ms 14592 KB Output is correct
29 Correct 14 ms 14592 KB Output is correct
30 Correct 14 ms 14592 KB Output is correct
31 Correct 15 ms 14592 KB Output is correct
32 Correct 14 ms 14592 KB Output is correct
33 Correct 14 ms 14592 KB Output is correct
34 Correct 14 ms 14592 KB Output is correct
35 Correct 14 ms 14720 KB Output is correct
36 Correct 14 ms 14592 KB Output is correct
37 Correct 13 ms 14592 KB Output is correct
38 Correct 14 ms 14592 KB Output is correct
39 Correct 124 ms 20728 KB Output is correct
40 Correct 137 ms 20728 KB Output is correct
41 Correct 121 ms 20728 KB Output is correct
42 Correct 135 ms 20856 KB Output is correct
43 Correct 175 ms 21368 KB Output is correct
44 Correct 131 ms 20344 KB Output is correct
45 Correct 94 ms 30072 KB Output is correct
46 Correct 66 ms 37624 KB Output is correct
47 Correct 204 ms 27768 KB Output is correct
48 Correct 273 ms 72952 KB Output is correct
49 Correct 272 ms 71416 KB Output is correct
50 Correct 211 ms 27768 KB Output is correct
51 Correct 217 ms 27896 KB Output is correct
52 Correct 252 ms 27896 KB Output is correct
53 Correct 233 ms 27128 KB Output is correct
54 Correct 413 ms 39776 KB Output is correct
55 Correct 31 ms 15488 KB Output is correct
56 Correct 21 ms 15080 KB Output is correct
57 Correct 75 ms 21116 KB Output is correct
58 Correct 63 ms 21480 KB Output is correct
59 Correct 92 ms 45048 KB Output is correct
60 Correct 242 ms 74872 KB Output is correct
61 Correct 256 ms 32504 KB Output is correct
62 Correct 208 ms 30840 KB Output is correct
63 Correct 243 ms 30840 KB Output is correct
64 Correct 551 ms 39160 KB Output is correct
65 Correct 507 ms 43512 KB Output is correct
66 Correct 287 ms 71052 KB Output is correct
67 Correct 163 ms 29664 KB Output is correct
68 Correct 389 ms 41336 KB Output is correct
69 Correct 403 ms 45560 KB Output is correct
70 Correct 360 ms 40312 KB Output is correct