Submission #118186

# Submission time Handle Problem Language Result Execution time Memory
118186 2019-06-18T10:25:00 Z baluteshih Fish (IOI08_fish) C++14
0 / 100
3000 ms 37952 KB
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define MEM(i,j) memset(i,j,sizeof i)
#define F first
#define S second
#define MP make_pair
#define ALL(v) v.begin(),v.end()
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

ll MOD;
pll fish[500005];
vector<ll> pl[500005];
bitset<500005> vis;
ll cnt[500005];

int main()
{jizz
	ll n,k,ans=0,tmp,num;
	cin >> n >> k >> MOD;
	for(int i=0;i<n;++i)
		cin >> fish[i].F >> fish[i].S;
	sort(fish,fish+n);
	for(int i=0;i<n;++i)
		pl[fish[i].S].pb(fish[i].F);
	for(int i=n-1;i>=0;--i)
		if(!vis[fish[i].S])
		{
			vis[fish[i].S]=1,tmp=1;
			for(int j=1;j<=k;++j)
				cnt[j]=0;
			for(int j=0;j<n&&fish[j].F*2<=fish[i].F;++j)
				++cnt[fish[j].S];
			for(int j=1;j<=k;++j)
				if(!vis[j])
					tmp=tmp*(cnt[j]+1)%MOD;
			num=1;
			for(int j=0;j<pl[fish[i].S].size()&&pl[fish[i].S][j]*2<=fish[i].F;++j)
				++num;
			ans=(ans+tmp*num)%MOD;
		}
	cout << ans << "\n";
}

Compilation message

fish.cpp: In function 'int main()':
fish.cpp:43:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j=0;j<pl[fish[i].S].size()&&pl[fish[i].S][j]*2<=fish[i].F;++j)
                ~^~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 12032 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 12160 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 12032 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 12260 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 12192 KB Output is correct
2 Incorrect 13 ms 12160 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 12160 KB Output is correct
2 Incorrect 161 ms 30532 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 12160 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 12428 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 120 ms 20220 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 51 ms 12280 KB Output is correct
2 Correct 27 ms 12408 KB Output is correct
3 Incorrect 43 ms 12288 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 445 ms 24952 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2449 ms 31628 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 722 ms 25032 KB Output is correct
2 Execution timed out 3036 ms 32412 KB Time limit exceeded
# Verdict Execution time Memory Grader output
1 Execution timed out 3035 ms 31076 KB Time limit exceeded
# Verdict Execution time Memory Grader output
1 Execution timed out 3018 ms 33760 KB Time limit exceeded
# Verdict Execution time Memory Grader output
1 Execution timed out 3023 ms 28792 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3102 ms 35104 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3017 ms 33500 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3033 ms 37952 KB Time limit exceeded
2 Halted 0 ms 0 KB -