제출 #116226

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
116226		mirbek01	자리 배치 (IOI18_seats)	C++11	25 / 100	4100 ms	57220 KiB

seats

# include <bits/stdc++.h>
# include "seats.h"

using namespace std;

const int N = 1e6 + 2;

int t[4][N * 4], ans;
vector <int> R, C;

void upd(int pos, int v = 1, int tl = 1, int tr = R.size()){
      if(tl == tr){
            t[0][v] = R[tl - 1];
            t[1][v] = C[tl - 1];
            t[2][v] = R[tl - 1];
            t[3][v] = C[tl - 1];
      } else {
            int tm = (tl + tr) >> 1;
            if(pos <= tm)
                  upd(pos, v << 1, tl, tm);
            else
                  upd(pos, v << 1 | 1, tm + 1, tr);
            t[0][v] = max(t[0][v << 1], t[0][v << 1 | 1]);
            t[1][v] = max(t[1][v << 1], t[1][v << 1 | 1]);
            t[2][v] = min(t[2][v << 1], t[2][v << 1 | 1]);
            t[3][v] = min(t[3][v << 1], t[3][v << 1 | 1]);
      }
}

pair < pair <int, int>, pair <int, int> > get(int l, int r, int v = 1, int tl = 1, int tr = R.size()){
      if(l > tr || tl > r){
            return {{0, 0}, {1e9, 1e9}};
      }
      if(l <= tl && tr <= r)
            return {{t[0][v], t[1][v]}, {t[2][v], t[3][v]}};
      int tm = (tl + tr) >> 1;
      pair < pair <int, int>, pair <int, int> > L, R;
      L = get(l, r, v << 1, tl, tm);
      R = get(l, r, v << 1 | 1, tm + 1, tr);
      L.first.first = max(L.first.first, R.first.first);
      L.first.second = max(L.first.second, R.first.second);
      L.second.first = min(L.second.first, R.second.first);
      L.second.second = min(L.second.second, R.second.second);
      return L;
}

int check(int x){
      pair < pair <int, int>, pair <int, int> > g = get(1, x);
      int ret = (g.first.first - g.second.first + 1) * (g.first.second - g.second.second + 1);
      return ret;
}

void give_initial_chart(int H, int W, vector<int> r, vector<int> c) {
      R = r, C = c;
      for(int i = 0; i < R.size(); i ++){
            upd(i + 1);
      }
}

int swap_seats(int a, int b) {
      if(a > b)
            swap(a, b);

      swap(R[a], R[b]);
      swap(C[a], C[b]);

      upd(a + 1);
      upd(b + 1);

      int ans = 1, cur = 1;

      while(cur < R.size()){
            int ret = check(cur + 1);
            if(ret == cur + 1){
                  cur ++, ans ++;
            } else {
                  cur = ret - 1;
            }
      }

      return ans;
}
/***
2 3 2
0 0
1 0
1 1
0 1
0 2
1 2
0 5
0 5
****/

컴파일 시 표준 에러 (stderr) 메시지

seats.cpp: In function 'void give_initial_chart(int, int, std::vector<int>, std::vector<int>)':
seats.cpp:55:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 0; i < R.size(); i ++){
                      ~~^~~~~~~~~~
seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:72:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       while(cur < R.size()){
             ~~~~^~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 6
• Subtask 3: 20 / 20
• Subtask 4: 0 / 6
• Subtask 5: 0 / 33
• Subtask 6: 0 / 30