Submission #1121150

#	Time	Username	Problem	Language	Result	Execution time	Memory
1121150		modwwe	도장 모으기 (JOI14_stamps)	C++17	100 / 100	46 ms	35836 KiB

stamps

#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(k) (1<<k)
#define mp make_pair
#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 ll mod2 = 1e9 + 7;
const int  mod1 = 998244353;
const ll base=67;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
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;
};
struct id
{
    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,t,lim,w,l,r ;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo();
    // checktime
}
int dp[3007][3007];
int u[3001];
int v[3001];
int d[3001];
int e[3001];
void phongbeo()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        cin>>u[i]>>v[i]>>d[i]>>e[i];
    s4=inf;
    for(int i=1; i<=n+1; i++)
        for(int j=0; j<=n+1; j++)
            dp[i][j]=inf;
    dp[n+1][0]=0;
    for(int i=n; i>=1; --i)
    {
        for(int j=n; j>=0; --j)
        {
            if(j) dp[i][j]=min(dp[i][j],dp[i+1][j]+d[i]+e[i]);/// out and out again
            dp[i][j]=min(dp[i][j],dp[i+1][j]+u[i]+v[i]);/// up an up
            if(j)dp[i][j]=min(dp[i][j],dp[i+1][j-1]+u[i]+e[i]);
            dp[i][j]=min(dp[i][j],dp[i+1][j+1]+d[i]+v[i]);
        }
        for(int j=1; j<=n; j++)
            dp[i][j]=min(dp[i][j],dp[i][j-1]+u[i]+e[i]);
        for(int j=n-1; j>=0; --j)
            dp[i][j]=min(dp[i][j],dp[i][j+1]+d[i]+v[i]);
        for(int j=0; j<=n; j++)
            dp[i][j]+=j*2*m;
    }
    cout<<dp[1][0]+(n+1)*m;
}

Compilation message (stderr)

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

• Subtask 1: 10 / 10
• Subtask 2: 75 / 75
• Subtask 3: 15 / 15