oj.uz

Submission #121763

# Submission time Handle Problem Language Result Execution time Memory
121763 2019-06-27T04:28:06 Z _7_7_ Lottery (CEOI18_lot) C++14
100 / 100
 478 ms 12536 KB 
#include <bits/stdc++.h>                                           

//#define int long long	
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);                                          
#define forev(i, b, a) for(int i = (b); i >= (a); --i)	    
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define sz(s) (int)s.size()
#define all(x) x.bg, x.en                                                                    
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define rbg rbegin()
#define bg begin()
#define en end()
#define s second
#define f first                                               
	
   
using namespace std;                  
   
   
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb; 
typedef long long ll;  
typedef double db;                            
						               
				
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 265;	
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);  
const int inf = 1e9, N = 1e4 + 11, mod = 1e9 + 7;
const db eps = 1e-12, pi = 3.14159265359; 
const ll INF = 1e18;	


int n, l, a[N], q, pos[N], c[N], add[N][104], res[N][104];
pii b[N];


main () {
	ios_base :: sync_with_stdio(0);
	cin.tie(0);                                        
	cout.tie(0);
	cin >> n >> l;
	forn (i, 1, n)
		cin >> a[i];                  

	cin >> q;
	forn (i, 1, q) {
		cin >> b[i].f;
		b[i].s = i;
	}

	sort(b + 1, b + 1 + q);
	b[0].f = -1;
	forn (i, 0, n)
		c[i] = q + 1;
	forn (i, 1, q) {
		pos[b[i].s] = i;
		forn (x, b[i - 1].f + 1, b[i].f)
			c[x] = i;						
	}


	forn (d, 1, n - l) {
		int cur = 0;
		forn (i, 1, l - 1)
			cur += (a[i] != a[i + d]);
		forn (i, l, n - d) {
			cur += (a[i] != a[i + d]);
			++add[i - l + 1][c[cur]];			
			++add[i + d - l + 1][c[cur]];
//			cout << i << ' ' << i + d << ' ' << cur << ' ' << c[cur] << endl;
			cur -= (a[i - l + 1] != a[i - l + 1 + d]);
		}
	}

	forn (i, 1, q) 
		forn (j, 1, n)
			res[j][i] = res[j][i - 1] + add[j][i];
	
	forn (i, 1, q) {
		forn (j, 1, n - l + 1)
			cout << res[j][pos[i]] << ' '; 
		cout << endl;		
	}
	return 0;
}

Compilation message

lot.cpp:47:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

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 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 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 640 KB Output is correct
11 Correct 2 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 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 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 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 14 ms 2048 KB Output is correct
14 Correct 10 ms 1920 KB Output is correct
15 Correct 10 ms 1764 KB Output is correct
16 Correct 14 ms 2048 KB Output is correct
17 Correct 13 ms 1920 KB Output is correct
18 Correct 14 ms 2048 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 433 ms 8636 KB Output is correct
2 Correct 425 ms 8568 KB Output is correct
3 Correct 397 ms 8696 KB Output is correct
4 Correct 357 ms 8568 KB Output is correct
5 Correct 125 ms 6488 KB Output is correct
6 Correct 341 ms 8220 KB Output is correct
7 Correct 124 ms 6604 KB Output is correct
8 Correct 193 ms 7456 KB Output is correct
9 Correct 358 ms 8500 KB Output is correct
10 Correct 356 ms 8568 KB Output is correct
11 Correct 16 ms 2432 KB Output is correct
12 Correct 190 ms 6904 KB Output is correct
13 Correct 146 ms 6848 KB Output is correct
14 Correct 154 ms 6844 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 433 ms 8636 KB Output is correct
2 Correct 425 ms 8568 KB Output is correct
3 Correct 397 ms 8696 KB Output is correct
4 Correct 357 ms 8568 KB Output is correct
5 Correct 125 ms 6488 KB Output is correct
6 Correct 341 ms 8220 KB Output is correct
7 Correct 124 ms 6604 KB Output is correct
8 Correct 193 ms 7456 KB Output is correct
9 Correct 358 ms 8500 KB Output is correct
10 Correct 356 ms 8568 KB Output is correct
11 Correct 16 ms 2432 KB Output is correct
12 Correct 190 ms 6904 KB Output is correct
13 Correct 146 ms 6848 KB Output is correct
14 Correct 154 ms 6844 KB Output is correct
15 Correct 357 ms 8500 KB Output is correct
16 Correct 321 ms 8312 KB Output is correct
17 Correct 463 ms 8540 KB Output is correct
18 Correct 360 ms 8468 KB Output is correct
19 Correct 368 ms 8488 KB Output is correct
20 Correct 381 ms 8568 KB Output is correct
21 Correct 364 ms 8568 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 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 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 14 ms 2048 KB Output is correct
14 Correct 10 ms 1920 KB Output is correct
15 Correct 10 ms 1764 KB Output is correct
16 Correct 14 ms 2048 KB Output is correct
17 Correct 13 ms 1920 KB Output is correct
18 Correct 14 ms 2048 KB Output is correct
19 Correct 433 ms 8636 KB Output is correct
20 Correct 425 ms 8568 KB Output is correct
21 Correct 397 ms 8696 KB Output is correct
22 Correct 357 ms 8568 KB Output is correct
23 Correct 125 ms 6488 KB Output is correct
24 Correct 341 ms 8220 KB Output is correct
25 Correct 124 ms 6604 KB Output is correct
26 Correct 193 ms 7456 KB Output is correct
27 Correct 358 ms 8500 KB Output is correct
28 Correct 356 ms 8568 KB Output is correct
29 Correct 16 ms 2432 KB Output is correct
30 Correct 190 ms 6904 KB Output is correct
31 Correct 146 ms 6848 KB Output is correct
32 Correct 154 ms 6844 KB Output is correct
33 Correct 357 ms 8500 KB Output is correct
34 Correct 321 ms 8312 KB Output is correct
35 Correct 463 ms 8540 KB Output is correct
36 Correct 360 ms 8468 KB Output is correct
37 Correct 368 ms 8488 KB Output is correct
38 Correct 381 ms 8568 KB Output is correct
39 Correct 364 ms 8568 KB Output is correct
40 Correct 391 ms 9436 KB Output is correct
41 Correct 19 ms 5120 KB Output is correct
42 Correct 371 ms 9308 KB Output is correct
43 Correct 368 ms 8940 KB Output is correct
44 Correct 373 ms 8948 KB Output is correct
45 Correct 478 ms 12536 KB Output is correct
46 Correct 31 ms 5368 KB Output is correct
47 Correct 464 ms 12472 KB Output is correct
48 Correct 441 ms 10616 KB Output is correct
49 Correct 446 ms 11356 KB Output is correct