oj.uz

Submission #136647

# Submission time Handle Problem Language Result Execution time Memory
136647 2019-07-26T01:45:35 Z liwi Pinball (JOI14_pinball) C++11
100 / 100
 939 ms 39252 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 100005

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(time(0));

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

struct node{
	int l,r;
	ll min;
};

int num_rows,num_cols;
ll dp[MAXN],res[MAXN],ans=LLONG_MAX/10;
pair<pii,pii> segs[MAXN];
node seg[12*MAXN];
vector<int> pos;
map<int,int> rev;

void build(int l, int r, int rt){
	seg[rt].l = l, seg[rt].r = r, seg[rt].min = LLONG_MAX/10;
	if(l == r) return;
	int mid = (l+r)/2;
	build(l,mid,rt<<1);
	build(mid+1,r,rt<<1|1);
}

void update(int pos, int rt, ll val){
	if(seg[rt].l == seg[rt].r){
		seg[rt].min = min(seg[rt].min,val);
		return;
	}
	int mid = (seg[rt].l+seg[rt].r)/2;
	if(pos <= mid) update(pos,rt<<1,val);
	else update(pos,rt<<1|1,val);
	seg[rt].min = min(seg[rt<<1].min,seg[rt<<1|1].min);
}

ll query(int l, int r, int rt){
	if(seg[rt].l == l && seg[rt].r == r) return seg[rt].min;
	int mid = (seg[rt].l+seg[rt].r)/2;
	if(r <= mid) return query(l,r,rt<<1);
	else if(l > mid) return query(l,r,rt<<1|1);
	return min(query(l,mid,rt<<1),query(mid+1,r,rt<<1|1));
}

int main(){
	scanf("%d %d",&num_rows,&num_cols);
	for(int i=1; i<=num_rows; i++){
		scanf(" %d %d %d %d",&segs[i].first.first,&segs[i].first.second,&segs[i].second.first,&segs[i].second.second);
		pos.pb(segs[i].first.first);
		pos.pb(segs[i].first.second);
		pos.pb(segs[i].second.first);
	}
	sort(all(pos)); complete_unique(pos);
	for(int i=1; i<=pos.size(); i++)
		rev[pos[i-1]] = i;

	for(int i=1; i<=num_rows; i++)
		dp[i] = LLONG_MAX/10;
	build(1,(int)pos.size(),1);
	for(int i=1; i<=num_rows; i++){
		if(segs[i].first.first == 1) dp[i] = segs[i].second.second;
		int l = segs[i].first.first, r = segs[i].first.second, m = segs[i].second.first;
		ll ndp = query(rev[l],rev[r],1)+segs[i].second.second;
		dp[i] = min(dp[i],ndp);
		update(rev[m],1,dp[i]);
		res[i]+=dp[i];
	}

	for(int i=1; i<=num_rows; i++)
		dp[i] = LLONG_MAX/10;
	build(1,(int)pos.size(),1);
	for(int i=1; i<=num_rows; i++){
		if(segs[i].first.second == num_cols) dp[i] = segs[i].second.second;
		int l = segs[i].first.first, r = segs[i].first.second, m = segs[i].second.first;
		ll ndp = query(rev[l],rev[r],1)+segs[i].second.second;
		dp[i] = min(dp[i],ndp);
		update(rev[m],1,dp[i]);
		res[i]+=dp[i];
	}

	for(int i=1; i<=num_rows; i++)
		ans = min(ans,res[i]-segs[i].second.second);
	if(ans == LLONG_MAX/10) printf("-1\n");
	else printf("%lld\n",ans);
}

Compilation message

pinball.cpp: In function 'int main()':
pinball.cpp:93:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1; i<=pos.size(); i++)
               ~^~~~~~~~~~~~
pinball.cpp:85:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&num_rows,&num_cols);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pinball.cpp:87:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %d %d %d %d",&segs[i].first.first,&segs[i].first.second,&segs[i].second.first,&segs[i].second.second);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 3 ms 440 KB Output is correct
19 Correct 5 ms 632 KB Output is correct
20 Correct 4 ms 504 KB Output is correct
21 Correct 3 ms 508 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 4 ms 760 KB Output is correct
24 Correct 5 ms 760 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 3 ms 440 KB Output is correct
19 Correct 5 ms 632 KB Output is correct
20 Correct 4 ms 504 KB Output is correct
21 Correct 3 ms 508 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 4 ms 760 KB Output is correct
24 Correct 5 ms 760 KB Output is correct
25 Correct 42 ms 2908 KB Output is correct
26 Correct 146 ms 7152 KB Output is correct
27 Correct 515 ms 14904 KB Output is correct
28 Correct 218 ms 8676 KB Output is correct
29 Correct 338 ms 12860 KB Output is correct
30 Correct 368 ms 10340 KB Output is correct
31 Correct 784 ms 24804 KB Output is correct
32 Correct 690 ms 18440 KB Output is correct
33 Correct 82 ms 6644 KB Output is correct
34 Correct 501 ms 19672 KB Output is correct
35 Correct 457 ms 39140 KB Output is correct
36 Correct 939 ms 39252 KB Output is correct
37 Correct 796 ms 39140 KB Output is correct
38 Correct 720 ms 39088 KB Output is correct