oj.uz

답안 #920083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
920083 2024-02-02T03:36:43 Z Faisal_Saqib Lottery (CEOI18_lot) C++17
65 / 100
 3000 ms 29060 KB 
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
const int N=1e4+1;
int a[N],l,n,cpy[N];
bool posa=0;
map<int,int> ans[N];
vector<vector<int>> hp;
void level_up()
{
	if(posa)
		return;
	for(int i=0;i<(n-l+1);i++)
	{
		for(int j=i+1;j<(n-l+1);j++)
		{
			int c=0;
			for(int dl=0;dl<l;dl++)
			{
				c+=(hp[i][dl]!=hp[j][dl]);
			}
			ans[i][c]++;
			ans[j][c]++;
		}
	}
	posa=1;
}
int main()
{
	cin>>n>>l;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];		
		cpy[i]=a[i];
	}
	sort(cpy,cpy+n);
	for(int i=0;i<n;i++)
		a[i]=lower_bound(cpy,cpy+n,a[i])-cpy;
	int q;
	cin>>q;
	if(q==1)
	{
		int k;
		cin>>k;
		if(k==0)
		{
			map<long long,int> cnt;
			for(int i=0;(i+l-1)<n;i++)
			{
				long long hash=0,base=717,mod=1e9+9;
				for(int j=0;j<l;j++)
				{
					hash=(hash*base)%mod;
					hash+=a[j+i];
					hash%=mod;
				}
				cnt[hash]++;
			}
			for(int i=0;(i+l-1)<n;i++)
			{
				long long hash=0,base=717,mod=1e9+9;
				for(int j=0;j<l;j++)
				{
					hash=(hash*base)%mod;
					hash+=a[j+i];
					hash%=mod;
				}
				cout<<cnt[hash]-1<<' ';
			}			
			cout<<'\n';
		}
		else
		{
			for(int i=0;(i+l-1)<n;i++)
			{
				vector<int> ap;
				for(int j=0;j<l;j++)
					ap.push_back(a[i+j]);
				hp.push_back(ap);
			}
			level_up();
			for(int i=0;(i+l-1)<n;i++)
			{
				int sp=0;
				for(int lp=0;lp<=k;lp++)
					if(ans[i].find(lp)!=ans[i].end())
						sp+=ans[i][lp];
				cout<<sp<<' ';
			}
			cout<<'\n';
		}
	}
	else
	{
		for(int i=0;(i+l-1)<n;i++)
		{
			vector<int> ap;
			for(int j=0;j<l;j++)
				ap.push_back(a[i+j]);
			hp.push_back(ap);
		}
		level_up();
		while(q--)
		{
			int k;
			cin>>k;
			for(int i=0;(i+l-1)<n;i++)
			{
				int sp=0;
				for(int lp=0;lp<=k;lp++)
					if(ans[i].find(lp)!=ans[i].end())
						sp+=ans[i][lp];
				cout<<sp<<' ';
			}
			cout<<'\n';
		}
	}
	return 0;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 856 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 4 ms 868 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 3 ms 856 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 856 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 4 ms 868 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 3 ms 856 KB Output is correct
13 Correct 31 ms 1368 KB Output is correct
14 Correct 453 ms 4692 KB Output is correct
15 Correct 478 ms 4944 KB Output is correct
16 Correct 329 ms 5200 KB Output is correct
17 Correct 355 ms 3244 KB Output is correct
18 Correct 360 ms 3484 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1112 KB Output is correct
2 Correct 4 ms 856 KB Output is correct
3 Correct 5 ms 856 KB Output is correct
4 Correct 38 ms 1120 KB Output is correct
5 Correct 408 ms 1528 KB Output is correct
6 Correct 114 ms 1360 KB Output is correct
7 Correct 403 ms 1104 KB Output is correct
8 Correct 339 ms 856 KB Output is correct
9 Correct 57 ms 856 KB Output is correct
10 Correct 37 ms 856 KB Output is correct
11 Correct 34 ms 1112 KB Output is correct
12 Correct 238 ms 1508 KB Output is correct
13 Correct 393 ms 1584 KB Output is correct
14 Correct 392 ms 1104 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1112 KB Output is correct
2 Correct 4 ms 856 KB Output is correct
3 Correct 5 ms 856 KB Output is correct
4 Correct 38 ms 1120 KB Output is correct
5 Correct 408 ms 1528 KB Output is correct
6 Correct 114 ms 1360 KB Output is correct
7 Correct 403 ms 1104 KB Output is correct
8 Correct 339 ms 856 KB Output is correct
9 Correct 57 ms 856 KB Output is correct
10 Correct 37 ms 856 KB Output is correct
11 Correct 34 ms 1112 KB Output is correct
12 Correct 238 ms 1508 KB Output is correct
13 Correct 393 ms 1584 KB Output is correct
14 Correct 392 ms 1104 KB Output is correct
15 Execution timed out 3040 ms 29060 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 856 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 4 ms 868 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 3 ms 856 KB Output is correct
13 Correct 31 ms 1368 KB Output is correct
14 Correct 453 ms 4692 KB Output is correct
15 Correct 478 ms 4944 KB Output is correct
16 Correct 329 ms 5200 KB Output is correct
17 Correct 355 ms 3244 KB Output is correct
18 Correct 360 ms 3484 KB Output is correct
19 Correct 4 ms 1112 KB Output is correct
20 Correct 4 ms 856 KB Output is correct
21 Correct 5 ms 856 KB Output is correct
22 Correct 38 ms 1120 KB Output is correct
23 Correct 408 ms 1528 KB Output is correct
24 Correct 114 ms 1360 KB Output is correct
25 Correct 403 ms 1104 KB Output is correct
26 Correct 339 ms 856 KB Output is correct
27 Correct 57 ms 856 KB Output is correct
28 Correct 37 ms 856 KB Output is correct
29 Correct 34 ms 1112 KB Output is correct
30 Correct 238 ms 1508 KB Output is correct
31 Correct 393 ms 1584 KB Output is correct
32 Correct 392 ms 1104 KB Output is correct
33 Execution timed out 3040 ms 29060 KB Time limit exceeded
34 Halted 0 ms 0 KB -