oj.uz

Submission #121047

# Submission time Handle Problem Language Result Execution time Memory
121047 2019-06-26T03:58:34 Z RockyB Lottery (CEOI18_lot) C++17
25 / 100
 3000 ms 604 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, l;
int a[N];

int diff(int x, int y) {
	int cnt = 0;
	rep(i, 0, l - 1) cnt += a[x + i] != a[y + i];
	return cnt;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> l;
	rep(i, 1, n) cin >> a[i];
	int q;
	cin >> q;
	while (q--) {
		int k;
		cin >> k;
		rep(i, 1, n - l + 1) {
			int cnt = -1;
			rep(j, 1, n - l + 1) cnt += diff(i, j) <= k;
			cout << cnt << ' ';
		}
		cout << nl;
	}
	ioi
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 25 ms 420 KB Output is correct
9 Correct 25 ms 384 KB Output is correct
10 Correct 17 ms 512 KB Output is correct
11 Correct 13 ms 384 KB Output is correct
12 Correct 20 ms 384 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 25 ms 420 KB Output is correct
9 Correct 25 ms 384 KB Output is correct
10 Correct 17 ms 512 KB Output is correct
11 Correct 13 ms 384 KB Output is correct
12 Correct 20 ms 384 KB Output is correct
13 Correct 64 ms 504 KB Output is correct
14 Execution timed out 3035 ms 544 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 448 KB Output is correct
2 Correct 527 ms 528 KB Output is correct
3 Correct 457 ms 604 KB Output is correct
4 Execution timed out 3044 ms 512 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 448 KB Output is correct
2 Correct 527 ms 528 KB Output is correct
3 Correct 457 ms 604 KB Output is correct
4 Execution timed out 3044 ms 512 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 25 ms 420 KB Output is correct
9 Correct 25 ms 384 KB Output is correct
10 Correct 17 ms 512 KB Output is correct
11 Correct 13 ms 384 KB Output is correct
12 Correct 20 ms 384 KB Output is correct
13 Correct 64 ms 504 KB Output is correct
14 Execution timed out 3035 ms 544 KB Time limit exceeded
15 Halted 0 ms 0 KB -