oj.uz

Submission #738258

# Submission time Handle Problem Language Result Execution time Memory
738258 2023-05-08T10:35:27 Z myrcella Seats (IOI18_seats) C++17
100 / 100
 3146 ms 93704 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

#include "seats.h"

const int maxn = 3e6+10;
pair<pii,int> tree[maxn*4];
pii add[maxn*4];
int n;
int val[maxn];
pii pos[maxn];
int h,w;

void update(int c,int cl,int cr,int l,int r,int val1,int val2) {
	if (l<=cl and cr<=r) {
		tree[c].fi.fi += val1;
		tree[c].fi.se += val2;
		add[c].fi += val1;
		add[c].se += val2;
		return;
	}
	if (add[c]!=MP(0,0)) {
		tree[c<<1].fi.fi += add[c].fi;
		tree[c<<1].fi.se += add[c].se;
		add[c<<1].fi += add[c].fi;
		add[c<<1].se += add[c].se;
		
		tree[c<<1|1].fi.fi += add[c].fi;
		tree[c<<1|1].fi.se += add[c].se;
		add[c<<1|1].fi += add[c].fi;
		add[c<<1|1].se += add[c].se;
		
		add[c] = {0,0};
	}
	int mid=cl+cr>>1;
	if (l<=mid) update(c<<1,cl,mid,l,r,val1,val2);
	if (r>mid) update(c<<1|1,mid+1,cr,l,r,val1,val2);
	if (tree[c<<1].fi==tree[c<<1|1].fi) tree[c] = {tree[c<<1].fi,tree[c<<1].se+tree[c<<1|1].se};
	else tree[c] = min(tree[c<<1],tree[c<<1|1]);
}

void update(int x,int y,int v) {
	int tm[4] = {val[x*w+y],val[x*w+y+1],val[(x+1)*w+y],val[(x+1)*w+y+1]};
	sort(tm,tm+4);
	if (tm[0]<tm[1]) update(1,0,n-1,tm[0],tm[1]-1,v,0);
	if (tm[2]<tm[3]) update(1,0,n-1,tm[2],tm[3]-1,0,v);
}

void init(int c,int cl,int cr) {
	tree[c] = {{0,0},cr-cl+1};
	add[c] = {0,0};
	if (cl==cr) return;
	int mid=cl+cr>>1;
	init(c<<1,cl,mid);
	init(c<<1|1,mid+1,cr);
	return;
}

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
  n = H*W;
  h = H+2,w=W+2;
  rep(i,0,maxn) val[i] = n;
  rep(i,0,n) {
	  R[i]++;
	  C[i]++;
	  val[R[i]*w+C[i]] = i;
	  pos[i] = {R[i],C[i]};
  }
  init(1,0,n-1);
  rep(i,0,h-1)
	rep(j,0,w-1) 
		update(i,j,1);
}

int swap_seats(int a, int b) {
	update(pos[a].fi,pos[a].se,-1);update(pos[a].fi-1,pos[a].se,-1);update(pos[a].fi,pos[a].se-1,-1);update(pos[a].fi-1,pos[a].se-1,-1);
	update(pos[b].fi,pos[b].se,-1);update(pos[b].fi-1,pos[b].se,-1);update(pos[b].fi,pos[b].se-1,-1);update(pos[b].fi-1,pos[b].se-1,-1);
	swap(pos[a],pos[b]);
	swap(val[pos[a].fi*w+pos[a].se],val[pos[b].fi*w+pos[b].se]);
	update(pos[a].fi,pos[a].se, 1);update(pos[a].fi-1,pos[a].se, 1);update(pos[a].fi,pos[a].se-1, 1);update(pos[a].fi-1,pos[a].se-1, 1);
	update(pos[b].fi,pos[b].se, 1);update(pos[b].fi-1,pos[b].se, 1);update(pos[b].fi,pos[b].se-1, 1);update(pos[b].fi-1,pos[b].se-1, 1);
	assert(tree[1].fi==MP(4,0));
	return tree[1].se;
}

Compilation message

seats.cpp: In function 'void update(int, int, int, int, int, int, int)':
seats.cpp:55:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |  int mid=cl+cr>>1;
      |          ~~^~~
seats.cpp: In function 'void init(int, int, int)':
seats.cpp:73:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   73 |  int mid=cl+cr>>1;
      |          ~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 12116 KB Output is correct
2 Correct 27 ms 12132 KB Output is correct
3 Correct 34 ms 12104 KB Output is correct
4 Correct 24 ms 12120 KB Output is correct
5 Correct 18 ms 12108 KB Output is correct
6 Correct 30 ms 12156 KB Output is correct
7 Correct 32 ms 12136 KB Output is correct
8 Correct 29 ms 12132 KB Output is correct
9 Correct 29 ms 12124 KB Output is correct
10 Correct 33 ms 12116 KB Output is correct
11 Correct 30 ms 12112 KB Output is correct
12 Correct 19 ms 12116 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 12116 KB Output is correct
2 Correct 27 ms 12132 KB Output is correct
3 Correct 34 ms 12104 KB Output is correct
4 Correct 24 ms 12120 KB Output is correct
5 Correct 18 ms 12108 KB Output is correct
6 Correct 30 ms 12156 KB Output is correct
7 Correct 32 ms 12136 KB Output is correct
8 Correct 29 ms 12132 KB Output is correct
9 Correct 29 ms 12124 KB Output is correct
10 Correct 33 ms 12116 KB Output is correct
11 Correct 30 ms 12112 KB Output is correct
12 Correct 19 ms 12116 KB Output is correct
13 Correct 69 ms 12968 KB Output is correct
14 Correct 85 ms 12956 KB Output is correct
15 Correct 53 ms 12960 KB Output is correct
16 Correct 38 ms 12884 KB Output is correct
17 Correct 60 ms 12976 KB Output is correct
18 Correct 57 ms 12972 KB Output is correct
19 Correct 51 ms 12968 KB Output is correct
20 Correct 43 ms 12884 KB Output is correct
21 Correct 35 ms 12956 KB Output is correct
22 Correct 35 ms 12980 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2001 ms 76632 KB Output is correct
2 Correct 980 ms 76740 KB Output is correct
3 Correct 867 ms 76624 KB Output is correct
4 Correct 811 ms 76628 KB Output is correct
5 Correct 858 ms 76736 KB Output is correct
6 Correct 777 ms 76628 KB Output is correct
7 Correct 833 ms 76740 KB Output is correct
8 Correct 931 ms 76620 KB Output is correct
9 Correct 892 ms 76732 KB Output is correct
10 Correct 825 ms 76604 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 12972 KB Output is correct
2 Correct 157 ms 19340 KB Output is correct
3 Correct 812 ms 76604 KB Output is correct
4 Correct 1987 ms 76624 KB Output is correct
5 Correct 731 ms 76604 KB Output is correct
6 Correct 1814 ms 92604 KB Output is correct
7 Correct 787 ms 92584 KB Output is correct
8 Correct 1010 ms 92492 KB Output is correct
9 Correct 970 ms 92580 KB Output is correct
10 Correct 909 ms 92600 KB Output is correct
11 Correct 884 ms 92564 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 13040 KB Output is correct
2 Correct 108 ms 13020 KB Output is correct
3 Correct 138 ms 13000 KB Output is correct
4 Correct 204 ms 13084 KB Output is correct
5 Correct 389 ms 13796 KB Output is correct
6 Correct 1382 ms 76980 KB Output is correct
7 Correct 1544 ms 93644 KB Output is correct
8 Correct 1275 ms 93704 KB Output is correct
9 Correct 2600 ms 93576 KB Output is correct
10 Correct 1112 ms 93580 KB Output is correct
11 Correct 1073 ms 93580 KB Output is correct
12 Correct 1057 ms 93672 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 12116 KB Output is correct
2 Correct 27 ms 12132 KB Output is correct
3 Correct 34 ms 12104 KB Output is correct
4 Correct 24 ms 12120 KB Output is correct
5 Correct 18 ms 12108 KB Output is correct
6 Correct 30 ms 12156 KB Output is correct
7 Correct 32 ms 12136 KB Output is correct
8 Correct 29 ms 12132 KB Output is correct
9 Correct 29 ms 12124 KB Output is correct
10 Correct 33 ms 12116 KB Output is correct
11 Correct 30 ms 12112 KB Output is correct
12 Correct 19 ms 12116 KB Output is correct
13 Correct 69 ms 12968 KB Output is correct
14 Correct 85 ms 12956 KB Output is correct
15 Correct 53 ms 12960 KB Output is correct
16 Correct 38 ms 12884 KB Output is correct
17 Correct 60 ms 12976 KB Output is correct
18 Correct 57 ms 12972 KB Output is correct
19 Correct 51 ms 12968 KB Output is correct
20 Correct 43 ms 12884 KB Output is correct
21 Correct 35 ms 12956 KB Output is correct
22 Correct 35 ms 12980 KB Output is correct
23 Correct 2001 ms 76632 KB Output is correct
24 Correct 980 ms 76740 KB Output is correct
25 Correct 867 ms 76624 KB Output is correct
26 Correct 811 ms 76628 KB Output is correct
27 Correct 858 ms 76736 KB Output is correct
28 Correct 777 ms 76628 KB Output is correct
29 Correct 833 ms 76740 KB Output is correct
30 Correct 931 ms 76620 KB Output is correct
31 Correct 892 ms 76732 KB Output is correct
32 Correct 825 ms 76604 KB Output is correct
33 Correct 68 ms 12972 KB Output is correct
34 Correct 157 ms 19340 KB Output is correct
35 Correct 812 ms 76604 KB Output is correct
36 Correct 1987 ms 76624 KB Output is correct
37 Correct 731 ms 76604 KB Output is correct
38 Correct 1814 ms 92604 KB Output is correct
39 Correct 787 ms 92584 KB Output is correct
40 Correct 1010 ms 92492 KB Output is correct
41 Correct 970 ms 92580 KB Output is correct
42 Correct 909 ms 92600 KB Output is correct
43 Correct 884 ms 92564 KB Output is correct
44 Correct 53 ms 13040 KB Output is correct
45 Correct 108 ms 13020 KB Output is correct
46 Correct 138 ms 13000 KB Output is correct
47 Correct 204 ms 13084 KB Output is correct
48 Correct 389 ms 13796 KB Output is correct
49 Correct 1382 ms 76980 KB Output is correct
50 Correct 1544 ms 93644 KB Output is correct
51 Correct 1275 ms 93704 KB Output is correct
52 Correct 2600 ms 93576 KB Output is correct
53 Correct 1112 ms 93580 KB Output is correct
54 Correct 1073 ms 93580 KB Output is correct
55 Correct 1057 ms 93672 KB Output is correct
56 Correct 124 ms 13788 KB Output is correct
57 Correct 327 ms 13700 KB Output is correct
58 Correct 492 ms 14808 KB Output is correct
59 Correct 1644 ms 93624 KB Output is correct
60 Correct 3146 ms 93580 KB Output is correct
61 Correct 1564 ms 93652 KB Output is correct
62 Correct 1274 ms 93512 KB Output is correct
63 Correct 3047 ms 93588 KB Output is correct
64 Correct 1824 ms 93612 KB Output is correct
65 Correct 1547 ms 93576 KB Output is correct
66 Correct 1777 ms 93580 KB Output is correct
67 Correct 1776 ms 93516 KB Output is correct
68 Correct 1331 ms 93644 KB Output is correct
69 Correct 2728 ms 93580 KB Output is correct