# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
416065 |
2021-06-01T21:32:06 Z |
Antekb |
Fish (IOI08_fish) |
C++14 |
|
3000 ms |
14596 KB |
#include<bits/stdc++.h>
#define st first
#define nd second
using namespace std;
const int N=5e5+5;
int tab[N], czy[N], ile[N];
int m;
int main(){
int n, k;
cin>>n>>k>>m;
for(int i=0; i<k; i++)tab[i]=1;
vector<pair<int, int> > V(n);
for(auto &i:V)cin>>i.st>>i.nd, i.nd--;
sort(V.begin(), V.end());
int wsk=0;
while(V[wsk].st*2<=V.back().st){
tab[V[wsk].nd]++;
ile[V[wsk].nd]++;
wsk++;
}
int ans=0;
for(int i=n-1; i>=0; i--){
if(czy[V[i].nd])continue;
while(wsk && V[wsk-1].st*2>V[i].st){
tab[V[--wsk].nd]--;
}
//for(int j=0; j<k; j++)cout<<tab[j]<<" ";
//cout<<"\n";
int t=1;
for(int j=0; j<k; j++){
if(!czy[j])t=(t*tab[j])%m;
}
ans+=t;
//cout<<t<<" ";
if(i+1-n && tab[V[i].nd]>ile[V[i].nd]){
t=1;
int u=1;
for(int j=0; j<k; j++){
if(j!=V[i].nd && !czy[j])t=(t*tab[j])%m;
if(czy[j])u=(u*tab[j])%m;
}
ans+=(t*(u-1))%m;
//cout<<t*(u-1)<<" ";
}
czy[V[i].nd]=1;
//cout<<"\n";
}
cout<<(ans%m+m)%m;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
204 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
304 KB |
Output is correct |
2 |
Incorrect |
569 ms |
10224 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
352 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
175 ms |
4284 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
332 KB |
Output is correct |
2 |
Incorrect |
13 ms |
452 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
272 ms |
6692 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
381 ms |
10320 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
342 ms |
7004 KB |
Output is correct |
2 |
Incorrect |
799 ms |
11276 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1515 ms |
10308 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3070 ms |
11696 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3025 ms |
10028 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3060 ms |
12700 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3074 ms |
10348 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3076 ms |
14596 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |