oj.uz

Submission #918960

# Submission time Handle Problem Language Result Execution time Memory
918960 2024-01-31T00:37:07 Z jpfr12 Nizin (COCI16_nizin) C++14
60 / 100
 32 ms 65536 KB 
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <math.h>
#include <cmath>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <fstream>
#include <bitset>
#include <iomanip>
 
typedef long long ll;
using namespace std;
int MOD = (int)1e9;
int MAXN = 1e6;
 
//classes

 
 
//global
vector<vector<ll>> dp;
vector<ll> vec;
ll sol(int left, int right, ll lvalue, ll rvalue){
  if(dp[left][right] != -1) return dp[left][right];
  else if(left+1 == right) return lvalue != rvalue;
  else if(left == right) return 0;
  if(lvalue == rvalue) dp[left][right] = sol(left+1, right-1, vec[left+1], vec[right-1]);
  else{
    dp[left][right] = 1+ min(sol(left+1, right, lvalue+ vec[left+1], rvalue), sol(left, right-1, lvalue, rvalue+vec[right-1]));
  }
  return dp[left][right];
}

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  //ifstream fin("input.txt");
  //ofstream fout("output.txt");
  //stop
  int n;
  cin >> n;
  vec.resize(n);
  dp.resize(n, vector<ll>(n, -1));
  for(ll& i: vec) cin >> i;
  cout << sol(0, n-1, vec[0], vec[n-1]) << '\n';
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 548 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2392 KB Output is correct
2 Correct 6 ms 4440 KB Output is correct
3 Correct 7 ms 6744 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6744 KB Output is correct
2 Correct 9 ms 8280 KB Output is correct
3 Correct 9 ms 8284 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 32 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 29 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 24 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -