oj.uz

Submission #727420

# Submission time Handle Problem Language Result Execution time Memory
727420 2023-04-20T15:49:24 Z model_code Bitaro's travel (JOI23_travel) C++17
100 / 100
 553 ms 4044 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t lll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
template<class T> using pqmin = priority_queue<T, vector<T>, greater<T>>;
template<class T> using pqmax = priority_queue<T>;
const ll inf=LLONG_MAX/3;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define si(x) ll(x.size())
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,l,r) for(int i=l;i<r;i++)
#define gnr(i,l,r) for(int i=r-1;i>=l;i--)
#define fore(i, a) for(auto &&i : a)
#define fore2(a, b, v) for(auto &&[a, b] : v)
#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)
template<class T> bool chmin(T& a, const T& b){ if(a <= b) return 0; a = b; return 1; }
template<class T> bool chmax(T& a, const T& b){ if(a >= b) return 0; a = b; return 1; }
template<class T, class U> bool chmin(T& a, const U& b){ return chmin(a, (T)b); }
template<class T, class U> bool chmax(T& a, const U& b){ return chmax(a, (T)b); }
ll gcd(ll a,ll b){return (b?gcd(b,a%b):a);}
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define VLL(name,size) vector<ll>name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>> name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>> name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>> name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define SUM(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class T, class F = less<>> void sor(T& a, F b = F{}){ sort(all(a), b); }
template<class T> void uniq(T& a){ sor(a); a.erase(unique(all(a)), end(a)); }
void outb(bool x){cout<<(x?"Yes":"No")<<"\n";}

template<class... Ts> void in(Ts&... t);
[[maybe_unused]] void print(){}
template<class T, class... Ts> void print(const T& t, const Ts&... ts);
template<class... Ts> void out(const Ts&... ts){ print(ts...); cout << '\n'; }
namespace IO{
#define VOID(a) decltype(void(a))
struct S{ S(){ cin.tie(nullptr)->sync_with_stdio(0); fixed(cout).precision(12); } }S;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){ in(get<idx>(t)...); }
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ ituple(t, make_index_sequence<tuple_size<T>::value>{}); }
template<class T> void o(const T& t){ o(t, P<4>{}); }
template<size_t N> void o(const char (&t)[N], P<4>){ cout << t; }
template<class T, size_t N> void o(const T (&t)[N], P<3>){ o(t[0]); for(size_t i = 1; i < N; i++){ o(' '); o(t[i]); } }
template<class T> auto o(const T& t, P<2>) -> VOID(cout << t){ cout << t; }
template<class T> auto o(const T& t, P<1>) -> VOID(begin(t)){ bool first = 1; for(auto&& x : t) { if(first) first = 0; else o(' '); o(x); } }
template<class T, size_t... idx> void otuple(const T& t, index_sequence<idx...>){ print(get<idx>(t)...); }
template<class T> auto o(T& t, P<0>) -> VOID(tuple_size<T>{}){ otuple(t, make_index_sequence<tuple_size<T>::value>{}); }
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO::i(t)); }
template<class T, class... Ts> void print(const T& t, const Ts&... ts){ IO::o(t); unpack(IO::o((cout << ' ', ts))); }
#undef unpack

int main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  LL(n);
  VLL(x,n);
  LL(q);
  while(q--){
    LL(s);
    ll ans=0;
    ll l=lower_bound(all(x),s)-x.begin();
    ll r=l;
    while(1){
      if(l==0){
        ans+=abs(x[n-1]-s);
        break;
      }
      if(r==n){
        ans+=abs(s-x[0]);
        break;
      }
      if(s-x[l-1]<=x[r]-s){
        ll i=lower_bound(all(x),2*s-x[r])-x.begin();
        ans+=s-x[i];
        s=x[i];
        l=i;
      }
      else{
        ll i=lower_bound(all(x),2*s-x[l-1])-x.begin()-1;
        ans+=x[i]-s;
        s=x[i];
        r=i+1;
      }
    }
    out(ans);
  }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 439 ms 3260 KB Output is correct
8 Correct 407 ms 3184 KB Output is correct
9 Correct 453 ms 3168 KB Output is correct
10 Correct 433 ms 3248 KB Output is correct
11 Correct 430 ms 3276 KB Output is correct
12 Correct 441 ms 3216 KB Output is correct
13 Correct 44 ms 2208 KB Output is correct
14 Correct 45 ms 832 KB Output is correct
15 Correct 310 ms 3616 KB Output is correct
16 Correct 282 ms 3600 KB Output is correct
17 Correct 323 ms 3728 KB Output is correct
18 Correct 69 ms 2136 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 33 ms 1876 KB Output is correct
18 Correct 21 ms 1876 KB Output is correct
19 Correct 22 ms 1876 KB Output is correct
20 Correct 21 ms 1876 KB Output is correct
21 Correct 21 ms 1876 KB Output is correct
22 Correct 35 ms 1876 KB Output is correct
23 Correct 21 ms 1876 KB Output is correct
24 Correct 24 ms 1876 KB Output is correct
25 Correct 31 ms 1876 KB Output is correct
26 Correct 22 ms 1876 KB Output is correct
27 Correct 38 ms 1876 KB Output is correct
28 Correct 38 ms 1876 KB Output is correct
29 Correct 24 ms 1876 KB Output is correct
30 Correct 22 ms 1876 KB Output is correct
31 Correct 32 ms 1876 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 439 ms 3260 KB Output is correct
39 Correct 407 ms 3184 KB Output is correct
40 Correct 453 ms 3168 KB Output is correct
41 Correct 433 ms 3248 KB Output is correct
42 Correct 430 ms 3276 KB Output is correct
43 Correct 441 ms 3216 KB Output is correct
44 Correct 44 ms 2208 KB Output is correct
45 Correct 45 ms 832 KB Output is correct
46 Correct 310 ms 3616 KB Output is correct
47 Correct 282 ms 3600 KB Output is correct
48 Correct 323 ms 3728 KB Output is correct
49 Correct 69 ms 2136 KB Output is correct
50 Correct 419 ms 4044 KB Output is correct
51 Correct 368 ms 3968 KB Output is correct
52 Correct 350 ms 4028 KB Output is correct
53 Correct 553 ms 4044 KB Output is correct
54 Correct 522 ms 3968 KB Output is correct
55 Correct 520 ms 3972 KB Output is correct
56 Correct 96 ms 3924 KB Output is correct
57 Correct 83 ms 3936 KB Output is correct
58 Correct 86 ms 3916 KB Output is correct