oj.uz

Submission #1102230

# Submission time Handle Problem Language Result Execution time Memory
1102230 2024-10-17T16:35:15 Z modwwe Lottery (CEOI18_lot) C++17
100 / 100
 567 ms 8320 KB 
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
};
void phongbeo();
const int inf = 1e9;
const int mod2 = 1e9 + 7;
const int  mod1 = 998244353;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};

int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root;
int kk;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
///modwwe
    phongbeo();
    // checktime
}
int d[10001][101];
int a[10001];
int pos[10001];
int pre[10001];
int ask[101];
void phongbeo()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        cin>>a[i];
    cin>>k;
    for(int i=1; i<=k; i++)
        cin>>ask[i],pos[ask[i]+1]++;
    for(int i=1; i<=m; i++)
        pos[i]+=pos[i-1];
    for(int g=1; g<=n; g++)
    {
        for(int i=1; i+g<=n; i++)
        {
            if(a[i+g]==a[i])
            {
                pre[i]++;
                if(i>m)
                    pre[i-m]--;
            }
        }
        for(int j=n; j>=1; --j)
        {
            pre[j]+=pre[j+1];
             if(j+g+m-1<=n){
            d[j][pos[m-pre[j]]]++;
            d[j+g][pos[m-pre[j]]]++;
            }
        }
        for(int j=1;j<=n;j++)
        pre[j]=0;
    }
     for(int j=1;j<=n-m+1;j++)
     for(int i=1;i<=k;++i)
      d[j][i]+=d[j][i-1];
for(int i=1;i<=k;i++)
{
    for(int j=1;j<=n-m+1;j++)
        cout<<d[j][pos[ask[i]]]<<" ";
        down
}
}

Compilation message

lot.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      | ^~~~
lot.cpp: In function 'int main()':
lot.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
lot.cpp:74:9: note: in expansion of macro 'fin'
   74 |         fin(task);
      |         ^~~
lot.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
lot.cpp:75:9: note: in expansion of macro 'fou'
   75 |         fou(task);
      |         ^~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 2 ms 2388 KB Output is correct
12 Correct 1 ms 2388 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 2 ms 2388 KB Output is correct
12 Correct 1 ms 2388 KB Output is correct
13 Correct 11 ms 2644 KB Output is correct
14 Correct 8 ms 2644 KB Output is correct
15 Correct 9 ms 2532 KB Output is correct
16 Correct 9 ms 2548 KB Output is correct
17 Correct 9 ms 2644 KB Output is correct
18 Correct 9 ms 2644 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 461 ms 4504 KB Output is correct
2 Correct 444 ms 4516 KB Output is correct
3 Correct 254 ms 4328 KB Output is correct
4 Correct 205 ms 4436 KB Output is correct
5 Correct 117 ms 2776 KB Output is correct
6 Correct 202 ms 4316 KB Output is correct
7 Correct 144 ms 2644 KB Output is correct
8 Correct 179 ms 3420 KB Output is correct
9 Correct 193 ms 4436 KB Output is correct
10 Correct 218 ms 4508 KB Output is correct
11 Correct 13 ms 2388 KB Output is correct
12 Correct 141 ms 3384 KB Output is correct
13 Correct 128 ms 2992 KB Output is correct
14 Correct 141 ms 2992 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 461 ms 4504 KB Output is correct
2 Correct 444 ms 4516 KB Output is correct
3 Correct 254 ms 4328 KB Output is correct
4 Correct 205 ms 4436 KB Output is correct
5 Correct 117 ms 2776 KB Output is correct
6 Correct 202 ms 4316 KB Output is correct
7 Correct 144 ms 2644 KB Output is correct
8 Correct 179 ms 3420 KB Output is correct
9 Correct 193 ms 4436 KB Output is correct
10 Correct 218 ms 4508 KB Output is correct
11 Correct 13 ms 2388 KB Output is correct
12 Correct 141 ms 3384 KB Output is correct
13 Correct 128 ms 2992 KB Output is correct
14 Correct 141 ms 2992 KB Output is correct
15 Correct 239 ms 4428 KB Output is correct
16 Correct 210 ms 4196 KB Output is correct
17 Correct 260 ms 4600 KB Output is correct
18 Correct 213 ms 4436 KB Output is correct
19 Correct 224 ms 4436 KB Output is correct
20 Correct 230 ms 4436 KB Output is correct
21 Correct 204 ms 4436 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 2 ms 2388 KB Output is correct
12 Correct 1 ms 2388 KB Output is correct
13 Correct 11 ms 2644 KB Output is correct
14 Correct 8 ms 2644 KB Output is correct
15 Correct 9 ms 2532 KB Output is correct
16 Correct 9 ms 2548 KB Output is correct
17 Correct 9 ms 2644 KB Output is correct
18 Correct 9 ms 2644 KB Output is correct
19 Correct 461 ms 4504 KB Output is correct
20 Correct 444 ms 4516 KB Output is correct
21 Correct 254 ms 4328 KB Output is correct
22 Correct 205 ms 4436 KB Output is correct
23 Correct 117 ms 2776 KB Output is correct
24 Correct 202 ms 4316 KB Output is correct
25 Correct 144 ms 2644 KB Output is correct
26 Correct 179 ms 3420 KB Output is correct
27 Correct 193 ms 4436 KB Output is correct
28 Correct 218 ms 4508 KB Output is correct
29 Correct 13 ms 2388 KB Output is correct
30 Correct 141 ms 3384 KB Output is correct
31 Correct 128 ms 2992 KB Output is correct
32 Correct 141 ms 2992 KB Output is correct
33 Correct 239 ms 4428 KB Output is correct
34 Correct 210 ms 4196 KB Output is correct
35 Correct 260 ms 4600 KB Output is correct
36 Correct 213 ms 4436 KB Output is correct
37 Correct 224 ms 4436 KB Output is correct
38 Correct 230 ms 4436 KB Output is correct
39 Correct 204 ms 4436 KB Output is correct
40 Correct 433 ms 5200 KB Output is correct
41 Correct 94 ms 2644 KB Output is correct
42 Correct 232 ms 5244 KB Output is correct
43 Correct 273 ms 4684 KB Output is correct
44 Correct 226 ms 4684 KB Output is correct
45 Correct 567 ms 8268 KB Output is correct
46 Correct 143 ms 2892 KB Output is correct
47 Correct 310 ms 8320 KB Output is correct
48 Correct 301 ms 6476 KB Output is correct
49 Correct 240 ms 6976 KB Output is correct