oj.uz

답안 #482364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482364 2021-10-24T06:56:08 Z Blistering_Barnacles Lottery (CEOI18_lot) C++11
45 / 100
 455 ms 16716 KB 
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp1[2005][2005] ,  a[2005] , k, l, m, n, o, p;
void solve(){
    cin >> n >> l ;
    for(ll i = 1 ; i <= n ; i++){
        cin >> a[i] ;
    }
    for(ll i = 1 ; i <= n - l + 1 ; i++){
        for(ll j = i + 1 ; j <= n - l + 1 ; j++){
            k = 0 ;
            for(ll j1 = 0 ; j1 < l ; j1++){
                k += (a[i + j1] != a[j + j1]) ;
            }
            dp1[i][k]++ , dp1[j][k]++ ;
        }
    }
    for(ll i = 1 ; i <= n - l + 1; i++){
        for(ll j = 1 ; j <= n - l + 1 ; j++){
            dp1[i][j] += dp1[i][j - 1] ;
        }
    }
    cin >> m ;
    while(m--){
        cin >> k ;
        for(ll i = 1 ; i <= n - l + 1; i++){
            cout << dp1[i][k] << " " ;
        }
        cout << endl ;
    }
}
int main(){
    fast ;
    q = 1 ;
    //cin >> q ;
    while(q--){
        solve() ;
    }
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 4 ms 972 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct
11 Correct 2 ms 1740 KB Output is correct
12 Correct 3 ms 1612 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 4 ms 972 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct
11 Correct 2 ms 1740 KB Output is correct
12 Correct 3 ms 1612 KB Output is correct
13 Correct 35 ms 16020 KB Output is correct
14 Correct 432 ms 10816 KB Output is correct
15 Correct 455 ms 10820 KB Output is correct
16 Correct 268 ms 14276 KB Output is correct
17 Correct 361 ms 13388 KB Output is correct
18 Correct 339 ms 13400 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 31 ms 16716 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 31 ms 16716 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 4 ms 972 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct
11 Correct 2 ms 1740 KB Output is correct
12 Correct 3 ms 1612 KB Output is correct
13 Correct 35 ms 16020 KB Output is correct
14 Correct 432 ms 10816 KB Output is correct
15 Correct 455 ms 10820 KB Output is correct
16 Correct 268 ms 14276 KB Output is correct
17 Correct 361 ms 13388 KB Output is correct
18 Correct 339 ms 13400 KB Output is correct
19 Runtime error 31 ms 16716 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -