oj.uz

Submission #748120

# Submission time Handle Problem Language Result Execution time Memory
748120 2023-05-25T12:16:15 Z Sam_a17 Group Photo (JOI21_ho_t3) C++17
100 / 100
 1137 ms 393116 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 5005;

// bit
struct fenwick {
  int size;
  vector<long long> tree; 

  void init(int size_) {
    tree.assign(size_ + 2, 0);
    size = size_;
  }

  void upd(int u, long long v) {
    while(u <= size) {
      tree[u] += v;
      u += u & (-u);
    }
  }

  long long qry(int u) {
    long long sum = 0;
    while(u > 0) {
      sum += tree[u];
      u -= u & (-u); // lsb
    }
    return sum;
  }

  long long sum(int l, int r) {
    return qry(r) - qry(l - 1);
  }

};

int n, pos[N];

int get(vector<int>& a, vector<int>& b) {
  fenwick ft;
  ft.init(n + 1);

  int ans = 0;
  for(int i = 0; i < n; i++) {
    int wh = pos[b[i]];
    ans += wh - 1 - ft.qry(wh);
    ft.upd(wh, 1);
  }

  return ans;
}

int dp[N];

int rec(int to) {
  if(to == 0) {
    return 0;
  }

  if(dp[to] != -1) {
    return dp[to];
  }

  int maxi = n - (n - to);

  fenwick ft, nft;
  ft.init(n + 1);
  nft.init(n + 1);
  for(int i = maxi + 1; i <= n; i++) {
    ft.upd(pos[i], 1);
  }

  int put = n * n;
  int sm = 0;
  for(int i = to; i >= 1; i--) {
    // fenwick nft = ft;

    int nd = to - i;
    int cur = maxi - nd;
    // dbg(cur)

    sm += n - pos[cur];
    sm -= ft.sum(pos[cur], n);
    sm += nft.sum(pos[cur], n);
    ft.upd(pos[cur], 1);

    sm -= nft.qry(pos[cur]);
    nft.upd(pos[cur], 1);
    
    // for(int j = to; j >= i; j--, cur++) {
    //   int suf = n - pos[cur];
    //   suf -= nft.sum(pos[cur], n);
    //   nft.upd(pos[cur], 1);
    //   sm += suf;
    // }

    // dbg(sm)
    put = min(put, sm + rec(i - 1));
  }

  dp[to] = put;
  return dp[to];
}

void solve_() {
  cin >> n;
  vector<int> a(n);

  for(int i = 0; i < n; i++) {
    cin >> a[i];
    pos[a[i]] = i + 1;
  }

  for(int i = 0; i <= n; i++) {
    dp[i] = -1;
  }

  // dbg(rec(3))
  cout << rec(n) << '\n';
}

int main() {
  setIO();
  
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }

  };
 
  int test_cases = 1; 
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:68:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 2 ms 968 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 2 ms 892 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 968 KB Output is correct
27 Correct 2 ms 972 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 2 ms 980 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 2 ms 968 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 2 ms 892 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 968 KB Output is correct
27 Correct 2 ms 972 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 28 ms 10432 KB Output is correct
32 Correct 25 ms 10452 KB Output is correct
33 Correct 26 ms 10440 KB Output is correct
34 Correct 24 ms 10452 KB Output is correct
35 Correct 24 ms 10452 KB Output is correct
36 Correct 24 ms 10452 KB Output is correct
37 Correct 22 ms 10452 KB Output is correct
38 Correct 23 ms 10452 KB Output is correct
39 Correct 24 ms 10452 KB Output is correct
40 Correct 24 ms 10452 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 2 ms 968 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 2 ms 892 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 968 KB Output is correct
27 Correct 2 ms 972 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 28 ms 10432 KB Output is correct
32 Correct 25 ms 10452 KB Output is correct
33 Correct 26 ms 10440 KB Output is correct
34 Correct 24 ms 10452 KB Output is correct
35 Correct 24 ms 10452 KB Output is correct
36 Correct 24 ms 10452 KB Output is correct
37 Correct 22 ms 10452 KB Output is correct
38 Correct 23 ms 10452 KB Output is correct
39 Correct 24 ms 10452 KB Output is correct
40 Correct 24 ms 10452 KB Output is correct
41 Correct 1137 ms 392516 KB Output is correct
42 Correct 1122 ms 392704 KB Output is correct
43 Correct 1080 ms 392824 KB Output is correct
44 Correct 1084 ms 392908 KB Output is correct
45 Correct 1100 ms 392864 KB Output is correct
46 Correct 1083 ms 392948 KB Output is correct
47 Correct 1076 ms 393000 KB Output is correct
48 Correct 1075 ms 392944 KB Output is correct
49 Correct 1075 ms 393116 KB Output is correct
50 Correct 1085 ms 392912 KB Output is correct
51 Correct 1080 ms 392940 KB Output is correct
52 Correct 1053 ms 393012 KB Output is correct
53 Correct 1073 ms 393076 KB Output is correct
54 Correct 1078 ms 392980 KB Output is correct
55 Correct 1071 ms 392940 KB Output is correct