# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
552253 | 2022-04-22T23:19:32 Z | LucaDantas | Sightseeing in Kyoto (JOI22_kyoto) | C++17 | 2000 ms | 1408 KB |
// mais carteacao usando só int pra tentar deixar mais rapido #pragma GCC optimize("unroll-loops") #pragma GCC optimize("Ofast") #include <bits/stdc++.h> using namespace std; constexpr int maxn = 100010; int a[maxn], b[maxn]; int dp[maxn]; int main() { int r, c; scanf("%d %d", &r, &c); for(int i = 0; i < r; i++) scanf("%d", a+i); for(int i = 0; i < c; i++) scanf("%d", b+i); memset(dp, 0x3f, sizeof dp); dp[0] = 0; for(int i = 0; i < r; i++) { for(int j = 1; j < c; j++) dp[j] = min(dp[j], dp[j-1] + a[i]); if(i == r-1) break; for(int j = 0; j < c; j++) dp[j] += b[j]; } printf("%d\n", dp[c-1]); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 596 KB | Output is correct |
2 | Correct | 1 ms | 596 KB | Output is correct |
3 | Incorrect | 1 ms | 596 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 596 KB | Output is correct |
2 | Correct | 1 ms | 640 KB | Output is correct |
3 | Correct | 1 ms | 596 KB | Output is correct |
4 | Correct | 926 ms | 996 KB | Output is correct |
5 | Correct | 22 ms | 980 KB | Output is correct |
6 | Correct | 4 ms | 724 KB | Output is correct |
7 | Execution timed out | 2084 ms | 1408 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 596 KB | Output is correct |
2 | Correct | 1 ms | 596 KB | Output is correct |
3 | Incorrect | 1 ms | 596 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |