oj.uz

Submission #366846

# Submission time Handle Problem Language Result Execution time Memory
366846 2021-02-15T11:43:55 Z leinad2 None (KOI17_cook) C++17
0 / 100
 1000 ms 748 KB 
#include<bits/stdc++.h>
#define INF 2110000000
using namespace std;
int dp[3010][3010], i, j, k, l, n, m, s, e, t, A[3010][3010], B[3010], ans=2147483647;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    for(cin>>n>>m>>s>>e>>t;i++<n;)
    {
        for(j=0;j++<m;)
        {
            cin>>A[i][j];
            A[i][j]+=A[i][j-1];
        }
    }
    for(i=0;i++<n;)cin>>B[i];
    for(i=0;i++<n;)
    {
        for(j=0;j++<m;)
        {
            dp[i][j]=INF;
        }
    }
    for(j=0;j++<m;)
    {
        for(i=0;i++<n;)
        {
            for(k=j-s;k>=j-e;k--)
            {
                if(k<0)continue;
                for(l=0;l++<n;)
                {
                    if(dp[l][k]==INF||(k&&l==i)||(k&&l==B[i]))continue;
                    dp[i][j]=min(dp[i][j], dp[l][k]+(k==0?0:t)+A[i][j]-A[i][k]);
                }
            }
        }
    }
    for(i=0;i++<n;)ans=min(ans, dp[i][m]);if(ans==INF)for(;;);
    cout<<ans;
  
}

Compilation message

cook.cpp: In function 'int main()':
cook.cpp:40:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   40 |     for(i=0;i++<n;)ans=min(ans, dp[i][m]);if(ans==INF)for(;;);
      |     ^~~
cook.cpp:40:43: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   40 |     for(i=0;i++<n;)ans=min(ans, dp[i][m]);if(ans==INF)for(;;);
      |                                           ^~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 748 KB Output is correct
2 Execution timed out 1091 ms 748 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 748 KB Output is correct
2 Execution timed out 1091 ms 748 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 748 KB Output is correct
2 Execution timed out 1091 ms 748 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 748 KB Output is correct
2 Execution timed out 1091 ms 748 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 748 KB Output is correct
2 Execution timed out 1091 ms 748 KB Time limit exceeded
3 Halted 0 ms 0 KB -