oj.uz

답안 #940173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
940173 2024-03-07T06:23:38 Z vjudge1 Lottery (CEOI18_lot) C++17
25 / 100
 3000 ms 600 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];
	int q;
	cin >> q;
	while(q--){
		int x;
		cin >> x;
		vector <int> ans(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++;
				}
				if(cnt <= x){
					ans[i]++;
					ans[j]++;
				}
			}
		}
		for(int i = 1; i <= n - l + 1; i++)
			cout << ans[i] <<" ";
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 344 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 348 KB Output is correct
8 Correct 21 ms 468 KB Output is correct
9 Correct 15 ms 472 KB Output is correct
10 Correct 17 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 12 ms 476 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 344 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 348 KB Output is correct
8 Correct 21 ms 468 KB Output is correct
9 Correct 15 ms 472 KB Output is correct
10 Correct 17 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 12 ms 476 KB Output is correct
13 Correct 59 ms 508 KB Output is correct
14 Execution timed out 3057 ms 500 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 344 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 348 KB Output is correct
8 Correct 21 ms 468 KB Output is correct
9 Correct 15 ms 472 KB Output is correct
10 Correct 17 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 12 ms 476 KB Output is correct
13 Correct 59 ms 508 KB Output is correct
14 Execution timed out 3057 ms 500 KB Time limit exceeded
15 Halted 0 ms 0 KB -