oj.uz

Submission #369923

# Submission time Handle Problem Language Result Execution time Memory
369923 2021-02-22T18:31:53 Z arnold518 Fish (IOI08_fish) C++14
100 / 100
 947 ms 38148 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 5e5;

int N, K;
ll MOD;
pii B[MAXN+10];
int C[MAXN+10];

int cnt[MAXN+10];
pii P[MAXN+10];
int I[MAXN+10];

ll ans;

struct SEG
{
	ll tree[MAXN*4+10];
	void init()
	{
		for(int i=0; i<MAXN*4+10; i++) tree[i]=0;
	}
	void update(int node, int tl, int tr, int p, int k)
	{
		if(tl==tr)
		{
			tree[node]+=k;
			tree[node]%=MOD;
			return;
		}
		int mid=tl+tr>>1;
		if(p<=mid) update(node*2, tl, mid, p, k);
		else update(node*2+1, mid+1, tr, p, k);
		tree[node]=tree[node*2]*tree[node*2+1]%MOD;
	}
	ll query(int node, int tl, int tr, int l, int r)
	{
		if(l>r) return 1;
		if(l<=tl && tr<=r) return tree[node];
		if(r<tl || tr<l) return 1;
		int mid=tl+tr>>1;
		return query(node*2, tl, mid, l, r)*query(node*2+1, mid+1, tr, l, r)%MOD;
	}
}seg;

int V[MAXN+10];

int main()
{
	scanf("%d%d%lld", &N, &K, &MOD);
	for(int i=1; i<=N; i++) scanf("%d%d", &B[i].first, &B[i].second);

	sort(B+1, B+N+1);
	
	for(int i=1; i<=K; i++) P[i].second=i;
	for(int i=1; i<=N; i++)
	{
		P[B[i].second].first=B[i].first;
	}

	sort(P+1, P+K+1);

	for(int i=1; i<=K; i++) I[P[i].second]=i;
	for(int i=1; i<=N; i++) B[i].second=I[B[i].second];
	for(int i=1; i<=N; i++) C[B[i].second]=i;

	//for(int i=1; i<=N; i++) printf("%d %d\n", B[i].first, B[i].second);

	seg.init();
	for(int i=1; i<=K; i++) seg.update(1, 1, K, i, 1);
	for(int i=1; i<=K; i++) V[i]=K+1;
	for(int i=1, j=1; i<=N; i++)
	{
		if(C[B[i].second]!=i) continue;
		for(; j<=N && B[j].first*2<=B[i].first; j++)
		{
			seg.update(1, 1, K, B[j].second, 1);
			if(B[j].second<B[i].second && V[B[j].second]==K+1) V[B[j].second]=B[i].second;
		}
		ans+=seg.query(1, 1, K, 1, B[i].second);
		ans%=MOD;
	}

	seg.init();
	for(int i=1; i<=K; i++) seg.update(1, 1, K, i, 1);
	for(int i=1, j=1; i<=N; i++)
	{
		if(C[B[i].second]!=i) continue;
		for(; j<=N && B[j].first*2<=B[i].first; j++)
		{
			seg.update(1, 1, K, B[j].second, 1);
		}
		if(B[i].second+1<=V[B[i].second]-1)
		{
			ll t=(seg.query(1, 1, K, B[i].second+1, V[B[i].second]-1)+MOD-1)%MOD;
			t*=seg.query(1, 1, K, 1, B[i].second-1); t%=MOD;
			ans+=t; ans%=MOD;
		}
	}

	printf("%lld\n", ans);
}

Compilation message

fish.cpp: In member function 'void SEG::update(int, int, int, int, int)':
fish.cpp:36:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |   int mid=tl+tr>>1;
      |           ~~^~~
fish.cpp: In member function 'll SEG::query(int, int, int, int, int)':
fish.cpp:46:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |   int mid=tl+tr>>1;
      |           ~~^~~
fish.cpp: In function 'int main()':
fish.cpp:55:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |  scanf("%d%d%lld", &N, &K, &MOD);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
fish.cpp:56:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   56 |  for(int i=1; i<=N; i++) scanf("%d%d", &B[i].first, &B[i].second);
      |                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15980 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 15980 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15980 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15980 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15980 KB Output is correct
2 Correct 11 ms 15980 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15980 KB Output is correct
2 Correct 195 ms 19908 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16108 KB Output is correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 15980 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 17568 KB Output is correct
2 Correct 121 ms 17920 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 16108 KB Output is correct
2 Correct 14 ms 16108 KB Output is correct
3 Correct 15 ms 16364 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 18412 KB Output is correct
2 Correct 286 ms 26604 KB Output is correct
3 Correct 262 ms 26604 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 19948 KB Output is correct
2 Correct 272 ms 26988 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 18412 KB Output is correct
2 Correct 269 ms 20076 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 266 ms 19820 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 20204 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 20332 KB Output is correct
2 Correct 275 ms 29676 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 22540 KB Output is correct
2 Correct 407 ms 26092 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 515 ms 22636 KB Output is correct
2 Correct 441 ms 29676 KB Output is correct
3 Correct 587 ms 30772 KB Output is correct
4 Correct 459 ms 29804 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 699 ms 23788 KB Output is correct
2 Correct 947 ms 37080 KB Output is correct
3 Correct 710 ms 38148 KB Output is correct
4 Correct 909 ms 35820 KB Output is correct