oj.uz

Submission #920123

# Submission time Handle Problem Language Result Execution time Memory
920123 2024-02-02T05:13:50 Z Faisal_Saqib Lottery (CEOI18_lot) C++17
65 / 100
 3000 ms 5308 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];
	}
	int q;
	cin>>q;
	if(q==1)
	{
		int k;
		cin>>k;
		if(k==0)
		{
			// sort(cpy,cpy+n);
			// for(int i=0;i<n;i++)
				// a[i]=lower_bound(cpy,cpy+n,a[i])-cpy;
			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
		{
			vector<int> ans(n);
			for(int i=0;(i+l-1)<n;i++)
			{
				for(int j=i+1;(j+l-1)<n;j++)
				{
					int dif=0;
					bool pos=1;
					for(int lp=0;lp<l;lp++)
					{
						if((l-lp+dif)<=k)
							break;
						dif+=(a[i+lp]!=a[j+lp]);
						if(dif>k)
						{
							pos=0;
							break;
						}
					}
					ans[i]+=pos;
					ans[j]+=pos;
				}
			}
			for(int i=0;(i+l-1)<n;i++)
				cout<<ans[i]<<' ';
			cout<<endl;
		}
	}
	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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 3 ms 888 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 3 ms 856 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 3 ms 888 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 3 ms 856 KB Output is correct
13 Correct 33 ms 1616 KB Output is correct
14 Correct 453 ms 4504 KB Output is correct
15 Correct 481 ms 4944 KB Output is correct
16 Correct 339 ms 5308 KB Output is correct
17 Correct 372 ms 3524 KB Output is correct
18 Correct 364 ms 3992 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 856 KB Output is correct
2 Correct 4 ms 856 KB Output is correct
3 Correct 4 ms 856 KB Output is correct
4 Correct 36 ms 1112 KB Output is correct
5 Correct 404 ms 1268 KB Output is correct
6 Correct 110 ms 1212 KB Output is correct
7 Correct 403 ms 960 KB Output is correct
8 Correct 337 ms 1104 KB Output is correct
9 Correct 56 ms 856 KB Output is correct
10 Correct 36 ms 856 KB Output is correct
11 Correct 34 ms 856 KB Output is correct
12 Correct 232 ms 1344 KB Output is correct
13 Correct 391 ms 1360 KB Output is correct
14 Correct 393 ms 1616 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 856 KB Output is correct
2 Correct 4 ms 856 KB Output is correct
3 Correct 4 ms 856 KB Output is correct
4 Correct 36 ms 1112 KB Output is correct
5 Correct 404 ms 1268 KB Output is correct
6 Correct 110 ms 1212 KB Output is correct
7 Correct 403 ms 960 KB Output is correct
8 Correct 337 ms 1104 KB Output is correct
9 Correct 56 ms 856 KB Output is correct
10 Correct 36 ms 856 KB Output is correct
11 Correct 34 ms 856 KB Output is correct
12 Correct 232 ms 1344 KB Output is correct
13 Correct 391 ms 1360 KB Output is correct
14 Correct 393 ms 1616 KB Output is correct
15 Execution timed out 3031 ms 856 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 3 ms 888 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 3 ms 856 KB Output is correct
13 Correct 33 ms 1616 KB Output is correct
14 Correct 453 ms 4504 KB Output is correct
15 Correct 481 ms 4944 KB Output is correct
16 Correct 339 ms 5308 KB Output is correct
17 Correct 372 ms 3524 KB Output is correct
18 Correct 364 ms 3992 KB Output is correct
19 Correct 3 ms 856 KB Output is correct
20 Correct 4 ms 856 KB Output is correct
21 Correct 4 ms 856 KB Output is correct
22 Correct 36 ms 1112 KB Output is correct
23 Correct 404 ms 1268 KB Output is correct
24 Correct 110 ms 1212 KB Output is correct
25 Correct 403 ms 960 KB Output is correct
26 Correct 337 ms 1104 KB Output is correct
27 Correct 56 ms 856 KB Output is correct
28 Correct 36 ms 856 KB Output is correct
29 Correct 34 ms 856 KB Output is correct
30 Correct 232 ms 1344 KB Output is correct
31 Correct 391 ms 1360 KB Output is correct
32 Correct 393 ms 1616 KB Output is correct
33 Execution timed out 3031 ms 856 KB Time limit exceeded
34 Halted 0 ms 0 KB -