oj.uz

답안 #1108404

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1108404 2024-11-04T04:24:53 Z koukirocks Lottery (CEOI18_lot) C++17
45 / 100
 51 ms 65536 KB 
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("popcnt")
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const ll MAX=2e5+10,P=1e9+7;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;
const ldb eps=1e-6;
const ldb PI=acos(-1.0);
const int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
template<typename T>
using vvector = vector<vector<T>>;

vvector<int> mm;
vvector<int> mmm;
int main() {
    speed;
    int n,l;
    cin>>n>>l;
    vector<int> a(n+1);
    for (int i=0;i<n;i++) {
        cin>>a[i];
    }
    mm.resize(n-l+1,vector<int>(n-l+1));
    for (int g=1;g+l<=n;g++) {
        int now=0;
        for (int i=0;i<l;i++) {
            if (a[i]!=a[i+g]) now++;
        }
        for (int i=0;i+g+l<=n;i++) {
            mm[i][i+g]=now;
            now-=(a[i]!=a[i+g]);
            now+=(a[i+l]!=a[i+g+l]);
        }
    }
    mmm.resize(n-l+1,vector<int>(l+1));
    for (int i=0;i<=n-l;i++) {
        for (int j=i+1;j<=n-l;j++) {
            mmm[i][mm[i][j]]++;
            mmm[j][mm[i][j]]++;
        }
        for (int j=1;j<=l;j++) mmm[i][j]+=mmm[i][j-1];
    }
    int q;
    cin>>q;
    while (q--) {
        int k;
        cin>>k;
        for (int i=0;i+l<=n;i++) cout<<mmm[i][k]<<" ";
        cout<<"\n";
    }
    return 0;
}

/*
10 10
2 34 545 56 3 3 65 2 7 6
*/

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 592 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 20 ms 16220 KB Output is correct
14 Correct 15 ms 10956 KB Output is correct
15 Correct 14 ms 10832 KB Output is correct
16 Correct 22 ms 14416 KB Output is correct
17 Correct 20 ms 13664 KB Output is correct
18 Correct 19 ms 13660 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 20 ms 16220 KB Output is correct
14 Correct 15 ms 10956 KB Output is correct
15 Correct 14 ms 10832 KB Output is correct
16 Correct 22 ms 14416 KB Output is correct
17 Correct 20 ms 13664 KB Output is correct
18 Correct 19 ms 13660 KB Output is correct
19 Runtime error 51 ms 65536 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -