oj.uz

Submission #361698

# Submission time Handle Problem Language Result Execution time Memory
361698 2021-01-31T09:29:18 Z rrrr10000 Boxes with souvenirs (IOI15_boxes) C++14
70 / 100
 460 ms 118196 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
#include "boxes.h"
ll delivery(int N,int K,int L,int p[]){
    ll n=N,k=K,l=L;
    vi P(n);rep(i,n)P[i]=p[i];
    chmin(k,n);
    ll ans=0;
    ll t=-1;
    while(t+1<n&&P[t+1]*2<=l)t++;
    for(ll i=t;i>=0;i-=k)ans+=P[i]*2;
    for(ll i=t+1;i<n;i+=k)ans+=(l-P[i])*2;
    rep(i,n-k+1){
        if(P[i+k-1]*2<=l)continue;
        if(P[i]*2>=l)break;
        ll res=l;
        for(ll j=i-1;j>=0;j-=k)res+=P[j]*2;
        for(ll j=i+k;j<n;j+=k)res+=(l-P[j])*2;
        chmin(ans,res);
    }
    return ans;
}

Compilation message

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:57:11: warning: declaration of 'P' shadows a global declaration [-Wshadow]
   57 |     vi P(n);rep(i,n)P[i]=p[i];
      |           ^
boxes.cpp:20:21: note: shadowed declaration is here
   20 | typedef pair<ll,ll> P;
      |                     ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 34 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 364 KB Output is correct
2 Correct 33 ms 364 KB Output is correct
3 Correct 34 ms 364 KB Output is correct
4 Correct 28 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 34 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 32 ms 364 KB Output is correct
16 Correct 33 ms 364 KB Output is correct
17 Correct 34 ms 364 KB Output is correct
18 Correct 28 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 34 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 35 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 50 ms 15212 KB Output is correct
34 Correct 19 ms 14060 KB Output is correct
35 Correct 20 ms 14188 KB Output is correct
36 Correct 48 ms 15084 KB Output is correct
37 Correct 58 ms 15596 KB Output is correct
38 Correct 59 ms 15340 KB Output is correct
39 Correct 44 ms 15724 KB Output is correct
40 Correct 26 ms 15340 KB Output is correct
41 Correct 47 ms 15340 KB Output is correct
42 Correct 25 ms 15596 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 34 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 32 ms 364 KB Output is correct
16 Correct 33 ms 364 KB Output is correct
17 Correct 34 ms 364 KB Output is correct
18 Correct 28 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 34 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 35 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 50 ms 15212 KB Output is correct
34 Correct 19 ms 14060 KB Output is correct
35 Correct 20 ms 14188 KB Output is correct
36 Correct 48 ms 15084 KB Output is correct
37 Correct 58 ms 15596 KB Output is correct
38 Correct 59 ms 15340 KB Output is correct
39 Correct 44 ms 15724 KB Output is correct
40 Correct 26 ms 15340 KB Output is correct
41 Correct 47 ms 15340 KB Output is correct
42 Correct 25 ms 15596 KB Output is correct
43 Correct 460 ms 118196 KB Output is correct
44 Correct 164 ms 117888 KB Output is correct
45 Incorrect 187 ms 117868 KB Output isn't correct
46 Halted 0 ms 0 KB -