oj.uz

Submission #760355

# Submission time Handle Problem Language Result Execution time Memory
760355 2023-06-17T13:37:34 Z Sam_a17 Diversity (CEOI21_diversity) C++17
18 / 100
 1561 ms 8756 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 blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
 
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, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } 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(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 << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T 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(373);
 
// 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 == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else {
    // freopen("skis.in", "r", stdin);
    // freopen("skis.out", "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 = 3e5 + 10;
struct query {
  long long l, r, ind;
};
 
long long n, q, a[N], s = 600, qar[N];
long long ans[N];
vector<query> queries;
 
bool cmp(query a, query b) {
  if(a.l / s ^ b.l / s) {
    return a.l / s < b.l / s;
  }
  return a.r > b.r;
}

long long cur[N];
map<int, int> mp;

void add(int ind) {
  dbg(a[ind])
  if(cur[a[ind]]) {
    mp[cur[a[ind]]]--;
    if(!mp[cur[a[ind]]]) {
      mp.erase(cur[a[ind]]);
    }
  }

  cur[a[ind]]++;
  mp[cur[a[ind]]]++;
}

void del(int ind) {
  mp[cur[a[ind]]]--;
  if(!mp[cur[a[ind]]]) {
    mp.erase(cur[a[ind]]);
  }

  cur[a[ind]]--;
  if(cur[a[ind]]) mp[cur[a[ind]]]++;
}

long long get(long long all) {
  vector<pair<long long, long long>> vec;
  for(auto i: mp) {
    if(i.second) {
      vec.push_back({i.first, i.second});
    }
  }

  vector<pair<long long, long long>> lef, rig;

  long long l = 0, r = 0;
  for(auto i: vec) {
    if(l == r) {
      if(i.second % 2 == 1) {
        l += (i.second + 1) / 2;
        r += i.second / 2;
        lef.push_back({i.first, (i.second + 1) / 2});
        if(i.second / 2) rig.push_back({i.first, i.second / 2});
      } else {
        l += i.second / 2;
        r += i.second / 2;
        if(i.second / 2) lef.push_back({i.first, i.second / 2});
        if(i.second / 2) rig.push_back({i.first, i.second / 2});
      }
    } else if(l > r) {
      if(i.second % 2 == 1) {
        l += i.second / 2;
        r += (i.second + 1) / 2;
        if(i.second / 2) lef.push_back({i.first, i.second / 2});
        rig.push_back({i.first, (i.second + 1) / 2});
      } else {
        l += i.second / 2;
        r += i.second / 2;
        if(i.second / 2) lef.push_back({i.first, i.second / 2});
        if(i.second / 2) rig.push_back({i.first, i.second / 2});
      }
    } else if(l < r) {
      assert(false);
    }
  }

  vector<pair<long long, long long>> curr;
  for(auto i: lef) {
    curr.push_back(i);
  }

  reverse(all(rig));
  for(auto i: rig) {
    curr.push_back(i);
  }

  long long ans = 0;


  // for each block
  for(auto i: vec) {
    ans += i.second * (i.first * (i.first + 1) / 2);
  }

  long long x = 0;
  for(auto i: curr) {
    long long y = all - x - i.first * i.second;

    //..x...CUR...y...
    for(long long j = 0; j <= i.second; j++) {
      for(long long k = 0; k <= i.second - j; k++) {
        long long cx = x + j * i.first;
        long long cy = y + k * i.first;

        ans += cx * cy * (i.second - j - k);
      }
    }

    for(long long j = 0; j < i.second; j++) {
      long long cx = x + j * i.first;
      ans += cx * i.first;
    }

    for(long long j = 0; j < i.second; j++) {
      long long cx = y + j * i.first;
      ans += cx * i.first;
    }

    x += i.first * i.second;
  }

  return ans;
}

void solve_() {
  int n, q; cin >> n >> q;
  
  for(int i = 0; i < n; i++) {
    cin >> a[i];
  }

  for(long long i = 1; i <= n; i++) {
    qar[i] = qar[i - 1] + i * i;
  }
 
  for(int i = 0; i < q; i++) {
    int a,b; cin >> a >> b;
    queries.push_back({--a, b, i});
  }

  sort(queries.begin(), queries.end(), cmp);

  int l = 0, r = 0;
  for(int i = 0; i < q; i++) {
    int currL = queries[i].l, currR = queries[i].r, idx = queries[i].ind;
    while(r < currR) {
      add(r++);
    }

    while(l > currL) {
      add(--l);
    }

    while(r > currR) {
      del(--r);
    }

    while(l < currL) {
      del(l++);
    }

    ans[idx] = get(currR - currL);
  }
  
  for(int i = 0; i < q; i++) {
    cout << ans[i] << '\n';
  }
}
 
int main() {
  setIO();
  
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

diversity.cpp: In function 'void setIO(std::string)':
diversity.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
diversity.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 340 KB Output is correct
3 Correct 39 ms 560 KB Output is correct
4 Correct 398 ms 2888 KB Output is correct
5 Correct 919 ms 5648 KB Output is correct
6 Correct 1333 ms 8396 KB Output is correct
7 Correct 1334 ms 8340 KB Output is correct
8 Correct 1353 ms 8340 KB Output is correct
9 Correct 1252 ms 8360 KB Output is correct
10 Correct 1320 ms 8468 KB Output is correct
11 Correct 1254 ms 8448 KB Output is correct
12 Correct 1298 ms 8400 KB Output is correct
13 Correct 1271 ms 8368 KB Output is correct
14 Correct 1269 ms 8412 KB Output is correct
15 Correct 1387 ms 8336 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 340 KB Output is correct
3 Correct 39 ms 560 KB Output is correct
4 Correct 398 ms 2888 KB Output is correct
5 Correct 919 ms 5648 KB Output is correct
6 Correct 1333 ms 8396 KB Output is correct
7 Correct 1334 ms 8340 KB Output is correct
8 Correct 1353 ms 8340 KB Output is correct
9 Correct 1252 ms 8360 KB Output is correct
10 Correct 1320 ms 8468 KB Output is correct
11 Correct 1254 ms 8448 KB Output is correct
12 Correct 1298 ms 8400 KB Output is correct
13 Correct 1271 ms 8368 KB Output is correct
14 Correct 1269 ms 8412 KB Output is correct
15 Correct 1387 ms 8336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 58 ms 608 KB Output is correct
19 Correct 407 ms 3096 KB Output is correct
20 Correct 876 ms 5856 KB Output is correct
21 Correct 1355 ms 8684 KB Output is correct
22 Correct 1386 ms 8716 KB Output is correct
23 Correct 1367 ms 8736 KB Output is correct
24 Correct 1290 ms 8700 KB Output is correct
25 Correct 1269 ms 8700 KB Output is correct
26 Correct 1561 ms 8704 KB Output is correct
27 Correct 1441 ms 8672 KB Output is correct
28 Correct 1402 ms 8520 KB Output is correct
29 Correct 1231 ms 8552 KB Output is correct
30 Correct 1207 ms 8756 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 340 KB Output is correct
3 Correct 39 ms 560 KB Output is correct
4 Correct 398 ms 2888 KB Output is correct
5 Correct 919 ms 5648 KB Output is correct
6 Correct 1333 ms 8396 KB Output is correct
7 Correct 1334 ms 8340 KB Output is correct
8 Correct 1353 ms 8340 KB Output is correct
9 Correct 1252 ms 8360 KB Output is correct
10 Correct 1320 ms 8468 KB Output is correct
11 Correct 1254 ms 8448 KB Output is correct
12 Correct 1298 ms 8400 KB Output is correct
13 Correct 1271 ms 8368 KB Output is correct
14 Correct 1269 ms 8412 KB Output is correct
15 Correct 1387 ms 8336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 58 ms 608 KB Output is correct
19 Correct 407 ms 3096 KB Output is correct
20 Correct 876 ms 5856 KB Output is correct
21 Correct 1355 ms 8684 KB Output is correct
22 Correct 1386 ms 8716 KB Output is correct
23 Correct 1367 ms 8736 KB Output is correct
24 Correct 1290 ms 8700 KB Output is correct
25 Correct 1269 ms 8700 KB Output is correct
26 Correct 1561 ms 8704 KB Output is correct
27 Correct 1441 ms 8672 KB Output is correct
28 Correct 1402 ms 8520 KB Output is correct
29 Correct 1231 ms 8552 KB Output is correct
30 Correct 1207 ms 8756 KB Output is correct
31 Incorrect 7 ms 340 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -