oj.uz

답안 #420415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
420415 2021-06-08T10:56:20 Z yuto1115 Arranging Shoes (IOI19_shoes) C++17
30 / 100
 36 ms 7736 KB 
#include "shoes.h"
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); i++)
#define rrep(i, n) for(ll i = ll(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

const int inf = 1001001001;
const ll linf = 1001001001001001001;

ll count_swaps(vi s) {
    int n = s.size() / 2;
    vvi l(n), r(n);
    rep(i, 2 * n) {
        if (s[i] < 0) l[-s[i] - 1].pb(i);
        else r[s[i] - 1].pb(i);
    }
    rep(i, n) if (l[i].size()) {
            ll ans = 0;
            rep(j, n) {
                if (l[i][j] < r[i][j]) {
                    auto it = lower_bound(all(r[i]), l[i][j]);
                    ans += j - (it - r[i].begin());
                } else {
                    auto it = lower_bound(all(l[i]), r[i][j]);
                    ans += j - (it - l[i].begin()) + 1;
                }
            }
            return ans;
        }
}

Compilation message

shoes.cpp: In function 'll count_swaps(vi)':
shoes.cpp:46:12: warning: control reaches end of non-void function [-Wreturn-type]
   46 |     vvi l(n), r(n);
      |            ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 4 ms 1100 KB Output is correct
21 Correct 4 ms 1100 KB Output is correct
22 Correct 34 ms 7392 KB Output is correct
23 Correct 36 ms 7488 KB Output is correct
24 Correct 34 ms 7476 KB Output is correct
25 Correct 27 ms 7736 KB Output is correct
26 Correct 35 ms 7480 KB Output is correct
27 Correct 34 ms 7496 KB Output is correct
28 Correct 29 ms 7608 KB Output is correct
29 Correct 28 ms 7608 KB Output is correct
30 Correct 29 ms 7592 KB Output is correct
31 Correct 34 ms 7356 KB Output is correct
32 Correct 30 ms 7732 KB Output is correct
33 Correct 28 ms 7612 KB Output is correct
34 Correct 28 ms 7600 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 29 ms 7596 KB Output is correct
38 Correct 33 ms 7732 KB Output is correct
39 Correct 29 ms 7608 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -