oj.uz

Submission #121066

# Submission time Handle Problem Language Result Execution time Memory
121066 2019-06-26T04:36:06 Z RockyB Lottery (CEOI18_lot) C++17
45 / 100
 3000 ms 796 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)1e4 + 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, q, 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 k[N], ans[101][N], cnt[N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
		freopen ("slow.out", "w", stdout);
	#endif
	Kazakhstan
	cin >> n >> l;
	rep(i, 1, n) cin >> a[i];

	cin >> q;	
	rep(i, 1, q) cin >> k[i];

	rep(i, 1, n - l + 1) {
		rep(j, 0, l) cnt[j] = 0;
		rep(j, 1, n - l + 1) cnt[diff(i, j)]++;
		rep(j, 1, l) cnt[j] += cnt[j - 1];
		rep(id, 1, q) {
			ans[id][i] = cnt[k[id]] - 1;
		}
	}
	rep(i, 1, q) {
		rep(j, 1, n - l + 1) cout << ans[i][j] << ' ';
		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 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 2 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 3 ms 512 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 2 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 3 ms 512 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 20 ms 384 KB Output is correct
14 Correct 304 ms 640 KB Output is correct
15 Correct 303 ms 508 KB Output is correct
16 Correct 201 ms 796 KB Output is correct
17 Correct 250 ms 760 KB Output is correct
18 Correct 259 ms 732 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 449 ms 512 KB Output is correct
2 Correct 605 ms 504 KB Output is correct
3 Correct 447 ms 504 KB Output is correct
4 Execution timed out 3031 ms 508 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 449 ms 512 KB Output is correct
2 Correct 605 ms 504 KB Output is correct
3 Correct 447 ms 504 KB Output is correct
4 Execution timed out 3031 ms 508 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 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 2 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 3 ms 512 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 20 ms 384 KB Output is correct
14 Correct 304 ms 640 KB Output is correct
15 Correct 303 ms 508 KB Output is correct
16 Correct 201 ms 796 KB Output is correct
17 Correct 250 ms 760 KB Output is correct
18 Correct 259 ms 732 KB Output is correct
19 Correct 449 ms 512 KB Output is correct
20 Correct 605 ms 504 KB Output is correct
21 Correct 447 ms 504 KB Output is correct
22 Execution timed out 3031 ms 508 KB Time limit exceeded
23 Halted 0 ms 0 KB -