oj.uz

답안 #678184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678184 2023-01-05T09:38:43 Z vjudge1 Fish (IOI08_fish) C++14
9 / 100
 441 ms 23492 KB 
#include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;

#define ii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vii vector<ii>
#define vll vector<ll>
#define vpll vector<pll>
#define matrix vector<vi>
#define matrixLL vector<vll>
#define vs vector<string>
#define vui vector<ui>
#define msi multiset<int>
#define mss multiset<string>
#define si set<int>
#define ss set<string>
#define PB push_back
#define PF push_front
#define PPB pop_back
#define PPF pop_front
#define X first
#define Y second
#define MP make_pair
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()

const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dxx[] = {-1, 1, 0, 0, 1, 1, -1, -1};
const int dyy[] = {0, 0, -1, 1, -1, 1, -1, 1};
const string abc="abcdefghijklmnopqrstuvwxyz";
const string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ld pi = 3.14159265;
int mod = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAXN = 1e6 + 7;
const int inf = mod;
const ll INF = 1e18;
const ll zero = ll(0);
const int logo = 20;
const int off = 1 << logo;
const int trsz = off << 1;

vii arr, ar;
int gdid[MAXN];

int seg[trsz];

void update(int x, int val){
	x += off;
	seg[x] = (seg[x] + val) % mod;
	for(x /= 2; x; x /= 2) seg[x] = (seg[x * 2] * seg[x * 2 + 1]) % mod;
}

int query(int x, int lo, int hi, int a, int b){
	if(lo >= b or hi <= a) return 1;
	if(lo >= a and hi <= b) return seg[x];
	int mid = (lo + hi) / 2;
	return (query(x * 2, lo, mid, a, b) * query(x * 2 + 1, mid, hi, a, b)) % mod;
}

vi c;
int pos[MAXN];
int kol[MAXN];

void solve(){
	fill(seg, seg + trsz, 1);
	fill(gdid, gdid + MAXN - 1, -1);
	int n, k, m;
	cin >> n >> k >> mod;
	arr.resize(n);
	REP(i, n) cin >> arr[i].X >> arr[i].Y;
	ar = arr;
	sort(all(arr));
	
	for(int i = n - 1; i >= 0; i--){
		if(gdid[arr[i].Y] == -1) gdid[arr[i].Y] = i, c.PB(arr[i].Y);
	}
	reverse(all(c));
	for(int i=0; i<c.size(); i++) pos[c[i]] = i;
	for(int i=0; i < n; i++) update(pos[ar[i].Y], 1); 
	
	//cout << "\nSORT\n";
	//for(auto &x : arr) cout << x.X << " " << x.Y << "\n";
	int mxsz = arr[n - 1].X;
	
	int ans = 0;
	int R = n - 1;
	for(int i = n - 1; i >= 0; i--){
		while(R >= 0 and arr[R].X * 2 > arr[i].X) update(pos[arr[R].Y], -1), R--;
		if(gdid[arr[i].Y] != i) continue;
		if(i == n - 1){
			REP(i, k + 1) kol[i] = seg[i + off];
		}
		
		//cout << i << " " << R << " " << arr[i].X << " " << arr[i].Y << " " << ans << " -> ";
		ans = (ans + query(1, 0, off, 0, pos[arr[i].Y] + 1)) % mod;
		//cout << ans << " -> ";
		
		
		if(i != n - 1 and arr[i].X * 2 > mxsz and kol[arr[i].Y] == seg[arr[i].Y + off]){
			int val = ((ll)query(1, 0, off, 0, pos[arr[i].Y]) * ((ll)query(1, 0, off, pos[arr[i].Y] + 1, off) - 1)) % mod;
			ans = (ans + val) % mod;
		}
		
		//cout << ans << "\n";
		
	}
	
	cout << ans << "\n";
}


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int t=1;
	//cin >> t;
	while(t--)solve();
	return 0;
}

Compilation message

fish.cpp: In function 'void solve()':
fish.cpp:90:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |  for(int i=0; i<c.size(); i++) pos[c[i]] = i;
      |               ~^~~~~~~~~
fish.cpp:79:12: warning: unused variable 'm' [-Wunused-variable]
   79 |  int n, k, m;
      |            ^

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12372 KB Output is correct
2 Incorrect 6 ms 12372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12456 KB Output is correct
2 Incorrect 308 ms 21068 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

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

Subtask #8
0 / 6.0

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

Subtask #9
0 / 6.0

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

Subtask #10
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 12492 KB Output is correct
2 Incorrect 10 ms 12592 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

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

Subtask #12
0 / 7.0

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

Subtask #13
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 17992 KB Output is correct
2 Incorrect 284 ms 21068 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

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