oj.uz

Submission #918956

# Submission time Handle Problem Language Result Execution time Memory
918956 2024-01-30T23:36:37 Z jpfr12 Nizin (COCI16_nizin) C++14
40 / 100
 1000 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<int>> dp;

int sol(int left, int right, vector<int>& vec){
  if(dp[left][right] != -1) return dp[left][right];
  else if(left+1 == right) return vec[left] != vec[right];
  else if(left == right) return 0;
  if(vec[left] == vec[right]) dp[left][right] = sol(left+1, right-1, vec);
  else{
    vector<int> temp = vec;
    temp[left+1] = temp[left+1] + temp[left];
    dp[left][right] = 1 + sol(left+1, right, temp);
    temp = vec;
    temp[right-1] += temp[right];
    dp[left][right] = min(dp[left][right], 1 + sol(left, right-1, temp));
  }
  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;
  vector<int> vec(n);
  dp.resize(n, vector<int>(n, -1));
  for(int& i: vec) cin >> i;
  cout << sol(0, n-1, vec) << '\n';
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 544 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 2 ms 600 KB Output is correct
3 Correct 30 ms 1144 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 2740 KB Output is correct
2 Correct 701 ms 4648 KB Output is correct
3 Execution timed out 1048 ms 7156 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1038 ms 7328 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 34 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 33 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 27 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 29 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -