oj.uz

답안 #777094

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
777094 2023-07-08T16:15:16 Z salmon Fish (IOI08_fish) C++14
95 / 100
 615 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
int N,M;
int mod;
int l,h;
vector<pair<int,int>> v;
vector<pair<int,int>> oh;
bool usable[500100];
int mapping[500100];
bool o[500100];
int iv[500100];

struct node{
	int s,e,m;
	long long int v;
	node *l,*r;

	node(int S, int E){
		s = S;
		e = E;
		m = (s + e)/2;

		v = 1;

		if(s != e){
			l = new node(s,m);
			r = new node(m + 1, e);
		}
	}

	void update(int i, int k){
		if(s == e){
			v += k;
			v %= mod;
			return;
		}

		if(i <= m){
			l -> update(i,k);
		}
		else{
			r -> update(i,k);
		}

		v = (l -> v * r -> v) % mod;
	}

	long long int query(int S, int E){
		if(E < S) return 1;

		if(S <= s && e <= E){
			return v;
		}

		long long int V = 1;

		if(S <= m){
			V *= l -> query(S,E);
		}
		if(m < E){
			V *= r -> query(S,E);
		}

		return V % mod;
	}

}*lroot;



int main(){
	scanf(" %d",&N);
	scanf(" %d",&M);

	scanf(" %d",&mod);

	int next[500100];

	for(int i = 1; i <= M; i++){
		next[i] = -1;
	}

	for(int i = 0; i <= M; i++) usable[i] = false;

	for(int i = 0; i < N; i++){
		scanf(" %d",&l);
		scanf(" %d",&h);

		v.push_back(make_pair(l,h));
	}

	sort(v.begin(),v.end(),greater<pair<int,int>>());

	for(int i = 0; i <= M; i++){
		o[i] = true;
	}

	for(int i = 0; i < v.size(); i++){
		if(o[v[i].second]){
			oh.push_back(v[i]);
			o[v[i].second] = false;
			iv[v[i].second] = v[i].first;
		}
		else if(v[i].first * 2 > iv[v[i].second]){
			next[v[i].second] = v[i].first;
		}
	}

	lroot = new node(0,M);

	int it = 0;
	int it1 = 0;

	reverse(oh.begin(),oh.end());

	for(int i = 0; i < oh.size(); i++){
		mapping[oh[i].second] = i;
	}

	reverse(oh.begin(),oh.end());

	reverse(v.begin(),v.end());

	long long int bigans = 0;

	for(int i = 0; i < N; i++){
		while(it != N && v[i].first >= v[it].first * 2){
			lroot -> update(mapping[v[it].second], 1);
            it++;
        }

		if(v[i] == oh.back()){
			usable[oh.back().second] = true;


 			bigans += lroot -> query(0,M - oh.size());
 			//printf("v: %d %d\n",root -> query(0,M - oh.size()),bigans);
 			bigans %= mod;

 			//printf("%d %d\n",next[v[i].second],v[i].first);

			if(next[v[i].second] == -1){
				pair<int,int> f = *lower_bound(oh.begin(),oh.end(),make_pair(v[i].first * 2 - 1, 1100100100),greater<pair<int,int>>());

				//printf("%d %d\n",mapping[v[i].second],mapping[f.second]);
				//printf("g: %d\n",(lroot -> query(mapping[v[i].second] + 1, mapping[f.second] ) - 1));

				bigans += (lroot -> query(0,mapping[v[i].second] - 1)) * (lroot -> query(mapping[v[i].second] + 1, mapping[f.second] ) - 1);
			}
			else{
				int e = lower_bound(oh.begin(),oh.end(),make_pair(next[v[i].second] * 2 - 1, 1100100100),greater<pair<int,int>>()) -> second;

                //printf("%d\n",(lroot -> query(0,mapping[v[i].second] - 1)) * (lroot -> query(mapping[v[i].second] + 1, mapping[e] ) - 1));
				bigans += (lroot -> query(0,mapping[v[i].second] - 1)) * (lroot -> query(mapping[v[i].second] + 1, mapping[e] ) - 1);
			}
			//bigans += lroot -> query(1,v[i].second - 1) * (long long int) lroot -> query(v[i].second + 1, M);
			bigans %= mod;

			//printf("%d %d %d %d\n",v[i].first,bigans,lroot -> query(1,v[i].second - 1) , (long long int) lroot -> query(v[i].second + 1, M));

			oh.pop_back();
		}
	}

	printf("%d",bigans);
}
/*
 *
5
3
700
8 3
7 2
4 1
2 3
2 2

5
3
7
2 2
5 1
8 3
4 1
2 3

2 500 200
1 1
2 1
*
 */

Compilation message

fish.cpp: In function 'int main()':
fish.cpp:98:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |  for(int i = 0; i < v.size(); i++){
      |                 ~~^~~~~~~~~~
fish.cpp:116:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |  for(int i = 0; i < oh.size(); i++){
      |                 ~~^~~~~~~~~~~
fish.cpp:165:11: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
  165 |  printf("%d",bigans);
      |          ~^  ~~~~~~
      |           |  |
      |           |  long long int
      |           int
      |          %lld
fish.cpp:112:6: warning: unused variable 'it1' [-Wunused-variable]
  112 |  int it1 = 0;
      |      ^~~
fish.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |  scanf(" %d",&N);
      |  ~~~~~^~~~~~~~~~
fish.cpp:73:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |  scanf(" %d",&M);
      |  ~~~~~^~~~~~~~~~
fish.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |  scanf(" %d",&mod);
      |  ~~~~~^~~~~~~~~~~~
fish.cpp:86:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |   scanf(" %d",&l);
      |   ~~~~~^~~~~~~~~~
fish.cpp:87:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |   scanf(" %d",&h);
      |   ~~~~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct

Subtask #5
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 145 ms 6420 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct

Subtask #8
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2260 KB Output is correct

Subtask #9
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 4420 KB Output is correct
2 Correct 83 ms 4472 KB Output is correct

Subtask #10
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2516 KB Output is correct
2 Correct 3 ms 2388 KB Output is correct
3 Correct 3 ms 2388 KB Output is correct

Subtask #11
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 6468 KB Output is correct
2 Correct 174 ms 6440 KB Output is correct
3 Correct 164 ms 6488 KB Output is correct

Subtask #12
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 6444 KB Output is correct
2 Correct 170 ms 6464 KB Output is correct

Subtask #13
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 6416 KB Output is correct
2 Correct 180 ms 6984 KB Output is correct

Subtask #14
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 175 ms 7140 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #15
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 192 ms 8196 KB Output is correct

Subtask #16
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 10972 KB Output is correct
2 Correct 196 ms 17348 KB Output is correct

Subtask #17
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 328 ms 22528 KB Output is correct
2 Correct 255 ms 21360 KB Output is correct

Subtask #18
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 272 ms 22528 KB Output is correct
2 Correct 302 ms 17304 KB Output is correct
3 Correct 319 ms 28504 KB Output is correct
4 Correct 305 ms 17280 KB Output is correct

Subtask #19
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 430 ms 28504 KB Output is correct
2 Correct 518 ms 65536 KB Output is correct
3 Correct 447 ms 65536 KB Output is correct
4 Correct 615 ms 50804 KB Output is correct