제출 #1105897

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1105897		modwwe	Matching (CEOI11_mat)	C++17	90 / 100	793 ms	65536 KiB

mat

#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".ans","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 = 1e18;
const int mod2 = 1e9+7;
const int  mod1 = 998244353;
const int base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0) 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,cost;
int kk,invf;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo(),down
    // checktime
}
int pw[1000001];
int c[1000001];
int a[1000001];
vector<int> v;
struct IT
{
    ib t[4000001];
    ib mer(ib a,ib b)
    {
        return {(a.a*pw[b.b]+b.a)%mod2,a.b+b.b};
    }
    void upd(int node,int l,int r,int l1,int x)
    {
        if(l==r)
        {
            t[node]= {x,1};
            if(x==0)t[node].b=0;
            return;
        }
        int mid=l+r>>1;
        if(l1<=mid) upd(node<<1,l,mid,l1,x);
        else upd(node<<1|1,mid+1,r,l1,x);
        t[node]=mer(t[node<<1],t[node<<1|1]);
    }
} st;
vector<int>ans;
void phongbeo()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        cin>>l,s4=(s4*base+l)%mod2;
    for(int i=1; i<=m; i++)
        cin>>a[i],v.pb(a[i]);
    sort(v.begin(),v.end());
    for(int i=1; i<=m; i++)
        a[i]=lower_bound(v.begin(),v.end(),a[i])-v.begin()+1;
    pw[0]=1;
    s2=1;
    for(int i=1; i<=n-1; i++)
        pw[i]=pw[i-1]*base%mod2,s2=add(s2,pw[i]);
    for(int i=1; i<=n; i++)
        st.upd(1,1,m,a[i],i);
    for(int i=1; i<=m-n+1; i++)
    {
        if(st.t[1].a==s4)
            ans.pb(i);
        st.upd(1,1,m,a[i],0);
        st.upd(1,1,m,a[i+n],i+n);
        s4=add(s4,s2);
    }
    cout<<ans.size(),down
        for(auto x:ans)
            cout<<x<<" ";
}

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

mat.cpp:72:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   72 | main()
      | ^~~~
mat.cpp: In member function 'void IT::upd(long long int, long long int, long long int, long long int, long long int)':
mat.cpp:104:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  104 |         int mid=l+r>>1;
      |                 ~^~
mat.cpp: In function 'int main()':
mat.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)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
mat.cpp:76:9: note: in expansion of macro 'fin'
   76 |         fin(task);
      |         ^~~
mat.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".ans","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
mat.cpp:77:9: note: in expansion of macro 'fou'
   77 |         fou(task);
      |         ^~~

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 8 / 8
• Subtask 10: 0 / 10
• Subtask 11: 10 / 10