oj.uz

Submission #369915

# Submission time Handle Problem Language Result Execution time Memory
369915 2021-02-22T18:13:24 Z arnold518 Fish (IOI08_fish) C++14
4 / 100
 769 ms 23788 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<=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);
		}
		ll t=seg.query(1, 1, K, B[i].second+1, V[B[i].second]-1);
		t--; if(t<0) t+=MOD;
		t*=seg.query(1, 1, K, 1, B[i].second-1); t%=MOD;
		t*=(seg.query(1, 1, K, B[i].second, B[i].second)+MOD-1)%MOD; 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:45:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 |   int mid=tl+tr>>1;
      |           ~~^~~
fish.cpp: In function 'int main()':
fish.cpp:54:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   54 |  scanf("%d%d%lld", &N, &K, &MOD);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
fish.cpp:55:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |  for(int i=1; i<=N; i++) scanf("%d%d", &B[i].first, &B[i].second);
      |                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 16108 KB Output isn't correct

Subtask #2
4.0 / 4.0

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

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 15980 KB Output isn't correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 15980 KB Output isn't correct

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15980 KB Output is correct
2 Incorrect 11 ms 15980 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 15980 KB Output is correct
2 Incorrect 205 ms 19948 KB Output isn't correct

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 15980 KB Output isn't correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 15980 KB Output isn't correct

Subtask #9
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 104 ms 17664 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 16144 KB Output is correct
2 Incorrect 17 ms 16108 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 18412 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 279 ms 20016 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 18540 KB Output is correct
2 Incorrect 290 ms 20076 KB Output isn't correct

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 271 ms 19820 KB Output isn't correct

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 308 ms 20204 KB Output isn't correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 273 ms 20204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 569 ms 22640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 571 ms 22508 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 769 ms 23788 KB Output isn't correct
2 Halted 0 ms 0 KB -