oj.uz

Submission #53746

# Submission time Handle Problem Language Result Execution time Memory
53746 2018-07-01T06:29:17 Z 윤교준(#1438) Fish (IOI08_fish) C++11
0 / 100
 3000 ms 33068 KB 
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define rb(x) ((x)&(-(x)))
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAXN = 500005;
const int MAXK = 7005;

int D[MAXK][MAXK];

int C[MAXK], O[MAXK], RO[MAXK];
int A[MAXN], B[MAXN];

ll Ans;
int N, K, MOD;

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> K >> MOD;
	for(int i = 1; i <= N; i++) cin >> B[i] >> A[i];

	for(int i = 1; i <= N; i++)
		upmax(C[A[i]], B[i]);
	

	iota(O, O+K+1, 0);
	sort(O+1, O+K+1, [&](int a, int b) {
		return C[a] > C[b];
	});
	for(int i = 1; i <= K; i++) RO[O[i]] = i;

	fill(C, C+K+1, 0);
	for(int i = 1; i <= N; i++) {
		A[i] = RO[A[i]];
		upmax(C[A[i]], B[i]);
	}

	for(int i = 1; i <= K; i++) {
		for(int j = 1; j <= N; j++)
			if(B[j]*2 <= C[i])
				D[i][A[j]]++;
	}

	fill(D[0], D[0]+K+1, -1);
	for(int i = 1; i <= K; i++) {
		ll ret = D[i][i] + 1;
		for(int j = i+1; j <= K; j++)
			ret = ret * (D[i][j] + 1) % MOD;
		Ans = (Ans + ret) % MOD;

		if(D[i][i] == D[i-1][i]) {
			ret = 1;
			for(int j = i+1; j <= K; j++)
				ret = ret * D[i][j] % MOD;
			for(int j = 1; j < i; j++)
				if(D[j][i] == D[i][i])
					ret = ret * D[i][j] % MOD;
			Ans = (Ans + ret) % MOD;
		}
	}

	cout << Ans << endl;

	return 0;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Incorrect 3 ms 704 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 704 KB Output is correct
2 Incorrect 247 ms 4540 KB Output isn't correct

Subtask #7
0 / 6.0

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

Subtask #8
0 / 6.0

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

Subtask #9
0 / 6.0

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

Subtask #10
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 4540 KB Output is correct
2 Correct 66 ms 8788 KB Output is correct
3 Incorrect 115 ms 18944 KB Output isn't correct

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3010 ms 19160 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

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

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3099 ms 28160 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3009 ms 33068 KB Time limit exceeded

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 156 ms 33068 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 297 ms 33068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 2035 ms 33068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 1461 ms 33068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3091 ms 33068 KB Time limit exceeded
2 Halted 0 ms 0 KB -