oj.uz

Submission #53811

# Submission time Handle Problem Language Result Execution time Memory
53811 2018-07-01T08:42:42 Z 김세빈(#1437) Fish (IOI08_fish) C++11
95 / 100
 1050 ms 95444 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> pii;

int T[1101010];
vector <int> V[505050];
int M[505050], K[505050], D[505050], C[505050];
bool chk[505050];
pii F[505050];
int n, k, m, sz, ans;

void update(int p, int v)
{
	p += sz;
	T[p] = v % m;
	
	for(p>>=1;p;p>>=1){
		T[p] = (T[p<<1] * T[p<<1|1]) % m;
	}
}

int get_mult(int l, int r)
{
	int ret = 1;
	l += sz, r += sz;
	
	for(;l<r;){
		if(l & 1) ret = (ret * T[l]) % m;
		if(~r & 1) ret = (ret * T[r]) % m;
		l = l+1 >> 1;
		r = r-1 >> 1;
	}
	if(l == r) ret = (ret * T[l]) % m;
	
	return ret;
}

bool comp(int ca, int cb) { return M[ca] < M[cb]; }

int main()
{
//	freopen("input.txt","r",stdin);
	
	int i, j, a, b;
	int s, e, mid;
	
	scanf("%d%d%d", &n, &k, &m);
	
	for(i=0;i<n;i++){
		scanf("%d%d", &a, &b); b--;
		F[i] = pii(a, b);
		M[b] = max(M[b], a);
	}
	
	sort(F, F+n);
	
	for(sz=1;sz<k;sz<<=1);
	for(i=1;i<sz+k;i++) T[i] = 1;
	
	for(i=0;i<k;i++) D[i] = i;
	sort(D, D+k, comp);
	for(i=0;i<k;i++) K[D[i]] = i;
	
	for(i=0;i<n;i++){
		V[F[i].second].push_back(F[i].first);
	}
	
	for(i=j=0;i<n;i++){
		for(;j<n && F[j].first * 2 <= F[i].first; j++){
			C[F[j].second] ++;
			update(K[F[j].second], C[F[j].second] + 1);
		}
		
		b = F[i].second;
	
		if(F[i].first == M[b] && !chk[b]){
			chk[b] = 1;
			
			for(s=K[b]+1,e=k-1;s<=e;){
				mid = s+e >> 1;
				if(upper_bound(V[b].begin(), V[b].end(), M[D[mid]]/2) - V[b].begin() <= C[b]) s = mid+1;
				else e = mid-1;
			}
			
			update(K[b], 1);
			ans = (ans + get_mult(0, s-1) + get_mult(0, K[b]) * C[b]) % m;
//			printf("%d %d %d %d\n", K[b], s-1, get_mult(0, s-1), get_mult(0, K[b]) * C[b]);
			update(K[b], C[b] + 1);
		}
	}
	
	printf("%d\n",ans);
	
	return 0;
}

Compilation message

fish.cpp: In function 'int get_mult(int, int)':
fish.cpp:32:8: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   l = l+1 >> 1;
       ~^~
fish.cpp:33:8: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   r = r-1 >> 1;
       ~^~
fish.cpp: In function 'int main()':
fish.cpp:82:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     mid = s+e >> 1;
           ~^~
fish.cpp:49:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &k, &m);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
fish.cpp:52:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b); b--;
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12292 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12392 KB Output is correct

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12392 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12552 KB Output is correct
2 Correct 15 ms 12552 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12552 KB Output is correct
2 Correct 211 ms 18880 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 18880 KB Output is correct

Subtask #8
6.0 / 6.0

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

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 18880 KB Output is correct
2 Correct 120 ms 18880 KB Output is correct

Subtask #10
6.0 / 6.0

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

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 18880 KB Output is correct
2 Correct 297 ms 25916 KB Output is correct
3 Correct 307 ms 32840 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 32840 KB Output is correct
2 Correct 285 ms 33140 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 33140 KB Output is correct
2 Correct 275 ms 33140 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 33140 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 33908 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 33908 KB Output is correct
2 Correct 478 ms 37024 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 578 ms 38984 KB Output is correct
2 Correct 446 ms 42308 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 559 ms 44520 KB Output is correct
2 Correct 537 ms 49872 KB Output is correct
3 Incorrect 585 ms 61712 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 790 ms 61712 KB Output is correct
2 Correct 774 ms 84316 KB Output is correct
3 Correct 942 ms 90460 KB Output is correct
4 Correct 1050 ms 95444 KB Output is correct