제출 #1114078

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1114078	2024-11-18 07:31:07	NotLinux	Nestabilnost (COI23_nestabilnost)	C++17	41 / 100	263 ms	197452 KiB

code1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// Author : FatihCihan
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
const int N = 5e3 + 7;
const int inf = 1e18 + 7;
int n , arr[N] , fk[N] , dp[N][N] , mini[N];
vector < int > tree[N];
void f(int node , int par){
  for(auto itr : tree[node]){
    if(itr == par)continue;
    f(itr , node);
  }
  int tmp[n+1] = {0};
  for(int i = 1;i<=n;i++){
    for(auto itr : tree[node]){
      if(itr == par)continue;
      int local_ans = mini[itr];// new component
      if((arr[node] + 1) % i == arr[itr] and dp[itr][i] != inf){// continuing same component
        local_ans = min(local_ans , dp[itr][i]);
        // cout << node << " -> " << itr << " with an " << i << endl;
      }
      tmp[i] += local_ans;
    }
  }
  mini[node] = inf;
  for(int i = 1;i<=n;i++){
    if(arr[node] < i){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 0 / 20
• Subtask 3: 7 / 7
• Subtask 4: 22 / 22
• Subtask 5: 0 / 39