oj.uz

Submission #121452

# Submission time Handle Problem Language Result Execution time Memory
121452 2019-06-26T14:17:54 Z RockyB Lottery (CEOI18_lot) C++17
45 / 100
 838 ms 8824 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimization ("unroll-loops")
#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 cnt1[N], cnt2[N];
pair <int, int> k[N];
int pref[N][102], ans[N][102];
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].f;
		k[i].s = i;
	}
	sort (k + 1, k + 1 + q);
	rep(d, 1, n - l) {
		int l1 = 1, l2 = 1 + d, df = 0;
		rep(i, 1, n) {
			if (a[i] != a[i + d]) ++df;
			while (i - l1 + 1 > l) {
				if (a[l1] != a[l2]) --df;
				l1++, l2++;
			}
			if (i >= l) {
				cnt1[l1] = df;
				cnt2[l2] = df;
			}
		}
		rep(i, 1, n) {
			if (i + d + l - 1 <= n) { 
				int pos = lower_bound (k + 1, k + 1 + q, mp(cnt1[i], -inf)) - k;
				//cerr << i << ' ' << cnt1[i] << ' ' << pos << nl;
				pref[i][pos]++;
			}
			if (i + l - 1 <= n && i - d > 0 && d) {
				int pos = lower_bound (k + 1, k + 1 + q, mp(cnt2[i], -inf)) - k;
				pref[i][pos]++;
			}
		}
		//cout << nl;
	}
	rep(i, 1, n) {
		rep(j, 1, q) {
			pref[i][j] += pref[i][j - 1];
			ans[i][k[j].s] = pref[i][j];
		}
	}
	rep(i, 1, q) {
		rep(j, 1, n - l + 1) {
			cout << ans[j][i] << ' ';
		}
		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 2 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 612 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 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 2 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 612 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 54 ms 2040 KB Output is correct
14 Correct 26 ms 2168 KB Output is correct
15 Correct 24 ms 2036 KB Output is correct
16 Correct 50 ms 2168 KB Output is correct
17 Correct 46 ms 2040 KB Output is correct
18 Correct 37 ms 2040 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 838 ms 8824 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 838 ms 8824 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 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 2 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 612 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 54 ms 2040 KB Output is correct
14 Correct 26 ms 2168 KB Output is correct
15 Correct 24 ms 2036 KB Output is correct
16 Correct 50 ms 2168 KB Output is correct
17 Correct 46 ms 2040 KB Output is correct
18 Correct 37 ms 2040 KB Output is correct
19 Runtime error 838 ms 8824 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -