oj.uz

답안 #349526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
349526 2021-01-17T18:10:40 Z ACmachine 자리 배치 (IOI18_seats) C++17
100 / 100
 1126 ms 177260 KB 
#include "seats.h"

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {0, 1, 1, 1, 0, -1, -1, -1};
const vi dx = {-1, -1, 0, 1, 1, 1, 0, -1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

struct node{
    int ans = INF; int count = 0;
    int total_balance = INF;
    void apply(int l, int r, int val){
        ans = val; count = 1;
        total_balance = ans;
    }
};
struct segtree{
    segtree(){}
    node comb(node const &a, node const &b){
        node res;
        int nrans = a.total_balance + b.ans;
        res.total_balance = a.total_balance + b.total_balance;
        if(a.ans < nrans){
            res.ans = a.ans;
            res.count = a.count;
        }
        else if(a.ans > nrans){
            res.ans = nrans;
            res.count = b.count;
        }
        else if(a.ans == nrans){
            res.ans = a.ans;
            res.count = a.count + b.count;
        }
        return res;
    } 
    void push(int l, int r, int v){ 
    }
    int sz;
    vector<node> tree; 
    segtree(int _sz){ // tree is resized to default values set in node
        sz = 1; while(sz < _sz) sz<<=1;
        tree.resize(2*sz); 
    } 
    void build(vector<node> &init){
        for(int i = 0; i < sz; ++i) 
            if(i < init.size())
                tree[i+sz] = init[i];
        for(int i = sz-1; i > 0; --i)
            tree[i] = comb(tree[i<<1], tree[i<<1|1]);
    } 
    node query(int l, int r){return query0(l, r, 0, sz, 1);} 
    node query0(int l, int r, int beg, int end, int v){ 
        if(beg >= l && end <= r)
            return tree[v];
        push(beg, end, v);
        int mid = (beg + end) >> 1;
        node res;
        if(beg >= r || mid <= l) res = query0(l, r, mid, end, v<<1|1); //[beg, mid]
        else if(mid >= r || end <= l) res = query0(l, r, beg, mid, v<<1);
        else res = comb(query0(l, r, beg, mid, v<<1), query0(l, r, mid, end, v<<1|1));
        return res;
    } 
    template<typename... T>
    void upd(int l, int r, T ...args){upd0(l, r, 0, sz, 1, args...);}
    template<typename... T>
    void upd0(int l, int r, int beg, int end, int v, T ...args){
        if(beg >= r || end <= l)
            return;
        if(beg >= l && end <= r){
            tree[v].apply(beg, end, args...);
            return;
        }
        push(beg, end, v);
        int mid = (beg + end) >> 1;
        upd0(l, r, beg, mid, v<<1, args...);
        upd0(l, r, mid, end, v<<1|1, args...);
        tree[v] = comb(tree[v<<1], tree[v<<1|1]);
    } 
};

vector<int> r, c;
vector<vector<int>> grid;
vector<vector<int>> bal;
segtree st;
int h, w;
void recalc_balance(int y, int x){
    if(y < 0 || y >= h || x < 0 || x >= w) return;
    int nbal = 0;
    array<int, 4> bf = {1, 1, 1, 1};
    REP(sm, 8){
        int ny = y + dy[sm];
        int nx = x + dx[sm];
        int ch = 0;
        if(ny < 0 || ny >= h || nx < 0 || nx >= w) continue;
        if(grid[ny][nx] < grid[y][x]) ch = 1;
        if(sm >= 0 && sm <= 2) bf[0] += ch;
        if(sm >= 2 && sm <= 4) bf[1] += ch;
        if(sm >= 4 && sm <= 6) bf[2] += ch;
        if((sm >= 6 && sm <= 7) || sm == 0) bf[3] += ch;
    }
    REP(j, 4){
        if(bf[j]%2 == 1){
            nbal++;
        }
        else{
            nbal--;
        }
    }
    bal[y][x] = nbal; 
}
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    r = R;
    c = C;
    h = H; w = W;
    grid = vector<vector<int>>(h, vector<int>(w));     
    REP(i, h * w){
        grid[r[i]][c[i]] = i;
    }
    bal = vector<vector<int>>(h, vector<int>(w));
    REP(i, h){
        REP(j, w) 
            recalc_balance(i, j);
    }
    st = segtree(h * w);
    vector<node> init(h * w);
    REP(i, h * w){
        node tmp;
        tmp.ans = bal[r[i]][c[i]];
        tmp.count = 1;
        tmp.total_balance = bal[r[i]][c[i]];
        init[i] = tmp;
    }
    st.build(init); 
}
int swap_seats(int a, int b) {
    swap(r[a], r[b]);
    swap(c[a], c[b]);
    swap(grid[r[a]][c[a]], grid[r[b]][c[b]]);
    FOR(ddy, -1, 2, 1){
        FOR(ddx, -1, 2, 1){
            int ny = r[a] + ddy;
            int nx = c[a] + ddx;
            if(!(ny < 0 || ny >= h || nx < 0 || nx >= w)){
                recalc_balance(ny, nx);
                int e = grid[ny][nx];
                st.upd(e, e + 1, bal[ny][nx]);
            }
            ny = r[b] + ddy;
            nx = c[b] + ddx;
            if(!(ny < 0 || ny >= h || nx < 0 || nx >= w)){
                recalc_balance(ny, nx);
                int e = grid[ny][nx];
                st.upd(e, e + 1, bal[ny][nx]);
            }
        }
    }
    auto no = st.query(0, h * w);
    return no.count;
}

Compilation message

seats.cpp: In member function 'void segtree::build(std::vector<node>&)':
seats.cpp:123:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |             if(i < init.size())
      |                ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 492 KB Output is correct
2 Correct 14 ms 492 KB Output is correct
3 Correct 17 ms 512 KB Output is correct
4 Correct 7 ms 492 KB Output is correct
5 Correct 7 ms 492 KB Output is correct
6 Correct 13 ms 492 KB Output is correct
7 Correct 15 ms 492 KB Output is correct
8 Correct 16 ms 492 KB Output is correct
9 Correct 16 ms 512 KB Output is correct
10 Correct 15 ms 492 KB Output is correct
11 Correct 13 ms 492 KB Output is correct
12 Correct 7 ms 492 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 492 KB Output is correct
2 Correct 14 ms 492 KB Output is correct
3 Correct 17 ms 512 KB Output is correct
4 Correct 7 ms 492 KB Output is correct
5 Correct 7 ms 492 KB Output is correct
6 Correct 13 ms 492 KB Output is correct
7 Correct 15 ms 492 KB Output is correct
8 Correct 16 ms 492 KB Output is correct
9 Correct 16 ms 512 KB Output is correct
10 Correct 15 ms 492 KB Output is correct
11 Correct 13 ms 492 KB Output is correct
12 Correct 7 ms 492 KB Output is correct
13 Correct 35 ms 1388 KB Output is correct
14 Correct 37 ms 1516 KB Output is correct
15 Correct 16 ms 1408 KB Output is correct
16 Correct 17 ms 2412 KB Output is correct
17 Correct 26 ms 1388 KB Output is correct
18 Correct 35 ms 1388 KB Output is correct
19 Correct 33 ms 1388 KB Output is correct
20 Correct 26 ms 1876 KB Output is correct
21 Correct 15 ms 1388 KB Output is correct
22 Correct 17 ms 2412 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 491 ms 68772 KB Output is correct
2 Correct 476 ms 75896 KB Output is correct
3 Correct 465 ms 75628 KB Output is correct
4 Correct 465 ms 75628 KB Output is correct
5 Correct 471 ms 75756 KB Output is correct
6 Correct 462 ms 75756 KB Output is correct
7 Correct 460 ms 75756 KB Output is correct
8 Correct 475 ms 75628 KB Output is correct
9 Correct 462 ms 75756 KB Output is correct
10 Correct 460 ms 75500 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 1516 KB Output is correct
2 Correct 81 ms 8704 KB Output is correct
3 Correct 461 ms 75500 KB Output is correct
4 Correct 494 ms 75628 KB Output is correct
5 Correct 415 ms 79396 KB Output is correct
6 Correct 709 ms 177260 KB Output is correct
7 Correct 450 ms 76628 KB Output is correct
8 Correct 473 ms 75628 KB Output is correct
9 Correct 473 ms 76268 KB Output is correct
10 Correct 481 ms 81772 KB Output is correct
11 Correct 503 ms 122348 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 1768 KB Output is correct
2 Correct 50 ms 1768 KB Output is correct
3 Correct 69 ms 1768 KB Output is correct
4 Correct 92 ms 1912 KB Output is correct
5 Correct 119 ms 2536 KB Output is correct
6 Correct 603 ms 72504 KB Output is correct
7 Correct 612 ms 72484 KB Output is correct
8 Correct 606 ms 73252 KB Output is correct
9 Correct 645 ms 72484 KB Output is correct
10 Correct 570 ms 72412 KB Output is correct
11 Correct 569 ms 72484 KB Output is correct
12 Correct 568 ms 72412 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 492 KB Output is correct
2 Correct 14 ms 492 KB Output is correct
3 Correct 17 ms 512 KB Output is correct
4 Correct 7 ms 492 KB Output is correct
5 Correct 7 ms 492 KB Output is correct
6 Correct 13 ms 492 KB Output is correct
7 Correct 15 ms 492 KB Output is correct
8 Correct 16 ms 492 KB Output is correct
9 Correct 16 ms 512 KB Output is correct
10 Correct 15 ms 492 KB Output is correct
11 Correct 13 ms 492 KB Output is correct
12 Correct 7 ms 492 KB Output is correct
13 Correct 35 ms 1388 KB Output is correct
14 Correct 37 ms 1516 KB Output is correct
15 Correct 16 ms 1408 KB Output is correct
16 Correct 17 ms 2412 KB Output is correct
17 Correct 26 ms 1388 KB Output is correct
18 Correct 35 ms 1388 KB Output is correct
19 Correct 33 ms 1388 KB Output is correct
20 Correct 26 ms 1876 KB Output is correct
21 Correct 15 ms 1388 KB Output is correct
22 Correct 17 ms 2412 KB Output is correct
23 Correct 491 ms 68772 KB Output is correct
24 Correct 476 ms 75896 KB Output is correct
25 Correct 465 ms 75628 KB Output is correct
26 Correct 465 ms 75628 KB Output is correct
27 Correct 471 ms 75756 KB Output is correct
28 Correct 462 ms 75756 KB Output is correct
29 Correct 460 ms 75756 KB Output is correct
30 Correct 475 ms 75628 KB Output is correct
31 Correct 462 ms 75756 KB Output is correct
32 Correct 460 ms 75500 KB Output is correct
33 Correct 36 ms 1516 KB Output is correct
34 Correct 81 ms 8704 KB Output is correct
35 Correct 461 ms 75500 KB Output is correct
36 Correct 494 ms 75628 KB Output is correct
37 Correct 415 ms 79396 KB Output is correct
38 Correct 709 ms 177260 KB Output is correct
39 Correct 450 ms 76628 KB Output is correct
40 Correct 473 ms 75628 KB Output is correct
41 Correct 473 ms 76268 KB Output is correct
42 Correct 481 ms 81772 KB Output is correct
43 Correct 503 ms 122348 KB Output is correct
44 Correct 36 ms 1768 KB Output is correct
45 Correct 50 ms 1768 KB Output is correct
46 Correct 69 ms 1768 KB Output is correct
47 Correct 92 ms 1912 KB Output is correct
48 Correct 119 ms 2536 KB Output is correct
49 Correct 603 ms 72504 KB Output is correct
50 Correct 612 ms 72484 KB Output is correct
51 Correct 606 ms 73252 KB Output is correct
52 Correct 645 ms 72484 KB Output is correct
53 Correct 570 ms 72412 KB Output is correct
54 Correct 569 ms 72484 KB Output is correct
55 Correct 568 ms 72412 KB Output is correct
56 Correct 98 ms 2180 KB Output is correct
57 Correct 167 ms 2076 KB Output is correct
58 Correct 323 ms 2920 KB Output is correct
59 Correct 1014 ms 72932 KB Output is correct
60 Correct 1126 ms 72952 KB Output is correct
61 Correct 1012 ms 72912 KB Output is correct
62 Correct 734 ms 74824 KB Output is correct
63 Correct 967 ms 74068 KB Output is correct
64 Correct 967 ms 73316 KB Output is correct
65 Correct 911 ms 73068 KB Output is correct
66 Correct 1025 ms 73580 KB Output is correct
67 Correct 944 ms 79212 KB Output is correct
68 Correct 837 ms 101484 KB Output is correct
69 Correct 1081 ms 119916 KB Output is correct