답안 #920136

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
920136	2024-02-02T05:49:52 Z	Sir_Ahmed_Imran	Lottery (CEOI18_lot)	C++17	45 / 100	76 ms	63568 KB

lot

                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define all(x) (x).begin(),(x).end()
#define pii pair<int,int>
#define N 2001
int s[N][N];
int x[N][N];
map<int,vector<int>> a;
void solve(){
    int n,m,o,p,q,r;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>o;
        x[i][0]=n-m;
        a[o].append(i);
    }
    for(auto& i:a){
        o=i.ss.size();
        for(int j=0;j<o;j++){
            for(int k=j+1;k<o;k++){
                for(int l=0;l<m;l++){
                    p=i.ss[j];
                    q=i.ss[k];
                    if(p-l<1 || q-l>n-m+1)
                        continue;
                    s[p-l][q-l]++;
                    s[q-l][p-l]++;
                    x[p-l][s[q-l][p-l]]++;
                    x[q-l][s[q-l][p-l]]++;
                }
            }
        }
    }
    cin>>o;
    for(int i=0;i<o;i++){
        cin>>p;
        for(int j=1;j<n-m+2;j++)
            cout<<x[j][m-p]<<' ';
        cout<<nl;
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

Compilation message

lot.cpp: In function 'void solve()':
lot.cpp:16:19: warning: unused variable 'r' [-Wunused-variable]
   16 |     int n,m,o,p,q,r;
      |                   ^

Subtask #1

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4440 KB	Output is correct
7	Correct	1 ms	4696 KB	Output is correct
8	Correct	2 ms	6748 KB	Output is correct
9	Correct	2 ms	6744 KB	Output is correct
10	Correct	3 ms	7512 KB	Output is correct
11	Correct	2 ms	8536 KB	Output is correct
12	Correct	2 ms	8792 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4440 KB	Output is correct
7	Correct	1 ms	4696 KB	Output is correct
8	Correct	2 ms	6748 KB	Output is correct
9	Correct	2 ms	6744 KB	Output is correct
10	Correct	3 ms	7512 KB	Output is correct
11	Correct	2 ms	8536 KB	Output is correct
12	Correct	2 ms	8792 KB	Output is correct
13	Correct	18 ms	31576 KB	Output is correct
14	Correct	5 ms	17244 KB	Output is correct
15	Correct	52 ms	26584 KB	Output is correct
16	Correct	76 ms	30032 KB	Output is correct
17	Correct	12 ms	28760 KB	Output is correct
18	Correct	24 ms	29216 KB	Output is correct

Subtask #3

0 / 20.0

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

Subtask #4

0 / 15.0

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

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4440 KB	Output is correct
7	Correct	1 ms	4696 KB	Output is correct
8	Correct	2 ms	6748 KB	Output is correct
9	Correct	2 ms	6744 KB	Output is correct
10	Correct	3 ms	7512 KB	Output is correct
11	Correct	2 ms	8536 KB	Output is correct
12	Correct	2 ms	8792 KB	Output is correct
13	Correct	18 ms	31576 KB	Output is correct
14	Correct	5 ms	17244 KB	Output is correct
15	Correct	52 ms	26584 KB	Output is correct
16	Correct	76 ms	30032 KB	Output is correct
17	Correct	12 ms	28760 KB	Output is correct
18	Correct	24 ms	29216 KB	Output is correct
19	Runtime error	35 ms	63568 KB	Execution killed with signal 11
20	Halted	0 ms	0 KB	-