제출 #1102253

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1102253		modwwe	캥거루 (CEOI16_kangaroo)	C++17	100 / 100	26 ms	512 KiB

kangaroo

#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 dp[2][2001];
int c[2];
int solve(int x,int y)
{
    memset(dp,0,sizeof dp);
    dp[1][0]=1;
    for(int i=2; i<=n; i++)
    {
        for(int j=0; j<=i; j++)
            dp[i&1][j]=0;
        if(i==x||i==y)/// dau
        {
            if(i==y)
            {
                if(n%2==1)
                {
                    for(int j=1; j<=i; j++)
                        dp[i&1][j]=dp[(i-1)&1][j-1];
                }
                else
                {
                    for(int j=0; j<=i; j++)
                        dp[i&1][j]=dp[(i-1)&1][j];
                 }
            }
            else
            {

                for(int j=1; j<=i; j++)
                    dp[i&1][j]=dp[(i-1)&1][j-1];
            }
        }
        else
        {
          for(int j=0;j<=i;j++)
          {
               dp[i&1][j]=add(1ll*dp[(i-1)&1][j-1]*(j-1+2-(i>x)-(i>y))%mod2,dp[i&1][j]);
               dp[i&1][j]=add(1ll*dp[(i-1)&1][j+1]*(j+1)%mod2,dp[i&1][j]);
          }
        }
    }
return dp[n&1][0];
}

void phongbeo()
{
    cin>>n>>c[0]>>c[1];
    s4=(s4+solve(c[0],c[1])+solve(n-c[0]+1,n-c[1]+1))%mod2;
    cout<<s4;
}

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

kangaroo.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      | ^~~~
kangaroo.cpp: In function 'int main()':
kangaroo.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)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
kangaroo.cpp:74:9: note: in expansion of macro 'fin'
   74 |         fin(task);
      |         ^~~
kangaroo.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)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
kangaroo.cpp:75:9: note: in expansion of macro 'fou'
   75 |         fou(task);
      |         ^~~

• Subtask 1: 6 / 6
• Subtask 2: 30 / 30
• Subtask 3: 15 / 15
• Subtask 4: 49 / 49