oj.uz

Submission #283534

# Submission time Handle Problem Language Result Execution time Memory
283534 2020-08-25T23:07:22 Z ipaljak Arranging Shoes (IOI19_shoes) C++14
10 / 100
 3 ms 2176 KB 
#include "shoes.h"

#include <bits/stdc++.h>

using namespace std;

#define TRACE(x) cerr << #x << " " << x << endl
#define _ << " " <<

typedef long long llint;

const int MAXN = 1e5 + 5;

bool bio[MAXN];

int n;
int nxt[2 * MAXN], loga[2 * MAXN];

vector<int> s;

void init() {
  memset(nxt, -1, sizeof nxt);
  map<int, int> m;
  for (int i = n - 1; i >= 0; --i) {
    if (m.find(-s[i]) != m.end()) nxt[i] = m[-s[i]];
    m[s[i]] = i;
  }
}

void add(int i) {
  for (; i < 2 * MAXN; i += i & -i) loga[i]++;
}

int sum(int lo, int hi) {
  int ret = 0;
  for (; hi > 0; hi -= hi & -hi) ret += loga[hi];
  for (--lo; lo > 0; lo -= lo & -lo) ret -= loga[lo];
  return ret;
}

llint count_swaps(vector<int> _s) {
  s = _s;
  n = (int) s.size();
  init();

  llint sol = 0;
  for (int i = 0; i < n; ++i) {
    if (bio[i]) continue;
    assert(nxt[i] != -1);
    int l = i, r = nxt[i];
    bio[l] = bio[r] = true;
    sol += (llint) r - l - 1;
    sol -= sum(l + 1, r + 1);
    add(l + 1);
    add(r + 1);
    if (s[i] > 0) ++sol;
  }

	return sol;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Runtime error 2 ms 2176 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Runtime error 3 ms 2176 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Runtime error 3 ms 2176 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Runtime error 2 ms 2176 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Runtime error 2 ms 2176 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -