제출 #296766

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
296766	2020-09-10 21:14:20	Bruteforceman	자리 배치 (IOI18_seats)	C++11	100 / 100	3576 ms	173944 KiB

seats

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "bits/stdc++.h"
#include "seats.h"
using namespace std;
const int maxn = 1e6 + 10;
vector <vector <int>> a;
vector <vector <bool>> can;
vector <int> row, col;
int h, w;
int arr[maxn];
bool inside(int x, int y) {
  return (0 <= x && x < h) && (0 <= y && y < w);
}
struct node {
  int val, cnt;
  int lazy;
  void add(int x) {
    val += x;
    lazy += x;
  }
} t[maxn * 4];
void pushdown(int c) {
  if(!t[c].lazy) return ;
  int l = c << 1;
  int r = l + 1;
  t[l].add(t[c].lazy);
  t[r].add(t[c].lazy);
  t[c].lazy = 0;
}
void build(int c = 1, int b = 0, int e = h * w - 1) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:104:7: warning: unused variable 'ans' [-Wunused-variable]
  104 |   int ans = 0;
      |       ^~~

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