oj.uz

Submission #940179

# Submission time Handle Problem Language Result Execution time Memory
940179 2024-03-07T06:27:02 Z vjudge1 Lottery (CEOI18_lot) C++17
25 / 100
 86 ms 32832 KB 
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int inf = 1e9, N  = 2005;
 
int a[N];

main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
	int n, l;
	cin >> n >> l;
	for(int i = 1; i <= n; i++)
		cin >> a[i];
	vector <int> has[n + 1];
	for(int i = 1; i <= n - l + 1; i++){
		for(int j = i + 1; j <= n - l + 1; j++){
			int cnt =  0;
			for(int le = 0; le < l; le++){
				if(a[i + le] != a[j + le])cnt++;
			}
			has[i].pb(cnt);
			has[j].pb(cnt);
		}
	}
	for(int i = 1; i <= n; i++)sort(all(has[i]));
	int q;
	cin >> q;
	while(q--){
		int x;
		cin >> x;
		for(int i = 1; i <= n - l + 1; i++){
			int it = upper_bound(all(has[i]), x) - has[i].begin();
			cout << it <<" ";
		}
		cout << endl;
	}
	
}	
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

lot.cpp:22:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 | main(){
      | ^~~~
lot.cpp: In function 'void fp(std::string)':
lot.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
lot.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 2 ms 812 KB Output is correct
10 Correct 3 ms 1628 KB Output is correct
11 Correct 3 ms 1672 KB Output is correct
12 Correct 3 ms 1372 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 2 ms 812 KB Output is correct
10 Correct 3 ms 1628 KB Output is correct
11 Correct 3 ms 1672 KB Output is correct
12 Correct 3 ms 1372 KB Output is correct
13 Runtime error 86 ms 32832 KB Memory limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 2 ms 812 KB Output is correct
10 Correct 3 ms 1628 KB Output is correct
11 Correct 3 ms 1672 KB Output is correct
12 Correct 3 ms 1372 KB Output is correct
13 Runtime error 86 ms 32832 KB Memory limit exceeded
14 Halted 0 ms 0 KB -