# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71383 | 2018-08-24T12:59:24 Z | Kmcode | Wiring (IOI17_wiring) | C++14 | 1000 ms | 263168 KB |
#include<bits/stdc++.h> //#include "books.h" using namespace std; #define MAX 5002 int n; long long int dp[MAX][MAX]; long long min_total_length(std::vector<int> r, std::vector<int> b) { for(int i=0;i<r.size();i++){ for(int j=0;j<b.size();j++){ dp[i][j]=LLONG_MAX; } } dp[0][0]=abs(r[0]-b[0]); for(int i=0;i<r.size();i++){ for(int j=0;j<b.size();j++){ if(i+1<r.size()){ dp[i+1][j]=min(dp[i+1][j],dp[i][j]+abs(r[i+1]-b[j])); } if(j+1<b.size()){ dp[i][j+1]=min(dp[i][j+1],dp[i][j]+abs(r[i]-b[j+1])); } if(i+1<r.size()&&j+1<b.size()){ dp[i+1][j+1]=min(dp[i+1][j+1],dp[i][j]+abs(r[i+1]-b[j+1])); } } } return dp[r.size()-1][b.size()-1]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 344 KB | Output is correct |
2 | Correct | 3 ms | 360 KB | Output is correct |
3 | Correct | 2 ms | 396 KB | Output is correct |
4 | Correct | 3 ms | 400 KB | Output is correct |
5 | Correct | 3 ms | 404 KB | Output is correct |
6 | Correct | 4 ms | 536 KB | Output is correct |
7 | Correct | 4 ms | 1512 KB | Output is correct |
8 | Correct | 4 ms | 1672 KB | Output is correct |
9 | Correct | 3 ms | 1728 KB | Output is correct |
10 | Correct | 4 ms | 1728 KB | Output is correct |
11 | Correct | 5 ms | 1728 KB | Output is correct |
12 | Correct | 4 ms | 1728 KB | Output is correct |
13 | Correct | 4 ms | 1728 KB | Output is correct |
14 | Correct | 5 ms | 1728 KB | Output is correct |
15 | Correct | 5 ms | 1728 KB | Output is correct |
16 | Correct | 4 ms | 1728 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 1728 KB | Output is correct |
2 | Correct | 4 ms | 1728 KB | Output is correct |
3 | Execution timed out | 1086 ms | 263168 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 263168 KB | Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 263168 KB | Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 344 KB | Output is correct |
2 | Correct | 3 ms | 360 KB | Output is correct |
3 | Correct | 2 ms | 396 KB | Output is correct |
4 | Correct | 3 ms | 400 KB | Output is correct |
5 | Correct | 3 ms | 404 KB | Output is correct |
6 | Correct | 4 ms | 536 KB | Output is correct |
7 | Correct | 4 ms | 1512 KB | Output is correct |
8 | Correct | 4 ms | 1672 KB | Output is correct |
9 | Correct | 3 ms | 1728 KB | Output is correct |
10 | Correct | 4 ms | 1728 KB | Output is correct |
11 | Correct | 5 ms | 1728 KB | Output is correct |
12 | Correct | 4 ms | 1728 KB | Output is correct |
13 | Correct | 4 ms | 1728 KB | Output is correct |
14 | Correct | 5 ms | 1728 KB | Output is correct |
15 | Correct | 5 ms | 1728 KB | Output is correct |
16 | Correct | 4 ms | 1728 KB | Output is correct |
17 | Correct | 3 ms | 1728 KB | Output is correct |
18 | Correct | 4 ms | 1728 KB | Output is correct |
19 | Execution timed out | 1086 ms | 263168 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |