제출 #1102230

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1102230		modwwe	Lottery (CEOI18_lot)	C++17	100 / 100	567 ms	8320 KiB

lot

#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
}
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 25
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20