# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
393360 | vanic | K blocks (IZhO14_blocks) | C++14 | 225 ms | 90812 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 <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;
const int maxk=105, maxn=1e5+5;
const int inf=1e9;
vector < pair < int, int > > v[maxk];
vector < int > valu[maxk];
int dp[maxn][maxk];
int a[maxn];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
for(int i=0; i<n; i++){
cin >> a[i];
}
int sum=0;
for(int i=0; i<k; i++){
v[i].push_back({sum, a[i]});
valu[i].push_back(sum+a[i]);
sum+=a[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |