# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100312 | tpoppo | Sličice (COCI19_slicice) | C++14 | 1082 ms | 1400 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500;
int n,m,k;
int b[MAXN];
int v[MAXN];
int dp[MAXN][MAXN];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m >> k;
for(int i=0;i<n;i++) cin >> v[i];
for(int i=0;i<=m;i++) cin >> b[i];
for(int i=0;i<n;i++){
for(int t=0;t<=k;t++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |