oj.uz

Submission #126088

# Submission time Handle Problem Language Result Execution time Memory
126088 2019-07-07T03:04:30 Z briansu Lottery (CEOI18_lot) C++14
35 / 100
 2307 ms 988 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
#define REP(i, n) for(int i = 0;i < n;i ++)
#define REP1(i, n) for(int i = 1;i <= n;i ++)
#define FILL(i, n) memset(i, n, sizeof(i))
#define X first
#define Y second
#define pb push_back
#define SZ(_a) ((int)(_a).size())
#define ALL(_a) (_a).begin(), (_a).end()
#ifdef brian
#define IOS()
template<typename T>void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...t> void _do(T &&x, t &&...X){cerr<<x<<", ";_do(X...);}
#define debug(...) {\
	fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\
	_do(__VA_ARGS__);\
}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...)
#define endl '\n'
#endif

const ll MAXn = 1e4 + 5;
const ll INF = ll(1e17);
const ll MOD = 1000000007;
const ll bs = 880301;

int dt[MAXn];
int qr[MAXn];

int d[MAXn], a[105][MAXn];

vector<ll> qdt;

int main(){
	IOS();
	ll n, l;
	cin>>n>>l;
	REP1(i, n)cin>>d[i];
	ll q;
	cin>>q;
	REP1(i, q)cin>>qr[i], qdt.pb(i);
	sort(ALL(qdt), [](int a,int b){return qr[a] < qr[b];});

	REP1(dif, n - l)
	{
		REP1(j, n - dif)dt[j] = (d[j] != d[j + dif]) + dt[j-1];
		vector<ll> v;
		REP1(i, n - l + 1 - dif)v.pb(i);
		sort(ALL(v), [&](int a,int b){return dt[a + l - 1] - dt[a - 1] < dt[b + l - 1] - dt[b - 1];});
		ll it = 0;
		for(auto t:qdt)while(it < SZ(v) && qr[t] >= dt[v[it] + l - 1] - dt[v[it] - 1])a[t][v[it]]++, a[t][v[it] + dif]++, it++;
	}
	REP1(x, q - 1)REP1(i, n - l + 1)a[qdt[x]][i] += a[qdt[x]-1][i];
	REP1(t, q)REP1(i, n - l + 1)cout<<a[t][i]<<" \n"[i == n - l + 1];
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2307 ms 928 KB Output is correct
2 Correct 2307 ms 868 KB Output is correct
3 Correct 1911 ms 952 KB Output is correct
4 Correct 1611 ms 860 KB Output is correct
5 Correct 449 ms 504 KB Output is correct
6 Correct 1429 ms 832 KB Output is correct
7 Correct 502 ms 632 KB Output is correct
8 Correct 915 ms 760 KB Output is correct
9 Correct 1599 ms 828 KB Output is correct
10 Correct 1623 ms 800 KB Output is correct
11 Correct 88 ms 376 KB Output is correct
12 Correct 1053 ms 724 KB Output is correct
13 Correct 636 ms 632 KB Output is correct
14 Correct 676 ms 620 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2307 ms 928 KB Output is correct
2 Correct 2307 ms 868 KB Output is correct
3 Correct 1911 ms 952 KB Output is correct
4 Correct 1611 ms 860 KB Output is correct
5 Correct 449 ms 504 KB Output is correct
6 Correct 1429 ms 832 KB Output is correct
7 Correct 502 ms 632 KB Output is correct
8 Correct 915 ms 760 KB Output is correct
9 Correct 1599 ms 828 KB Output is correct
10 Correct 1623 ms 800 KB Output is correct
11 Correct 88 ms 376 KB Output is correct
12 Correct 1053 ms 724 KB Output is correct
13 Correct 636 ms 632 KB Output is correct
14 Correct 676 ms 620 KB Output is correct
15 Correct 2065 ms 920 KB Output is correct
16 Correct 1323 ms 780 KB Output is correct
17 Correct 1733 ms 916 KB Output is correct
18 Correct 1643 ms 892 KB Output is correct
19 Correct 1649 ms 828 KB Output is correct
20 Correct 1665 ms 988 KB Output is correct
21 Correct 1641 ms 772 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -