oj.uz

답안 #234671

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
234671 2020-05-25T06:15:48 Z AlexLuchianov 함박 스테이크 (JOI20_hamburg) C++14
21 / 100
 3000 ms 3636 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <cassert>
#include <random>
#include <algorithm>

using namespace std;

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const nmax = 200000;
int const inf = 1000000000;

int const sigma = 4;

class Rect{
public:
  int x;
  int y;
  int x2;
  int y2;
  Rect operator + (Rect a) {
    return {max(x, a.x), max(y, a.y), min(x2, a.x2), min(y2, a.y2)};
  }
  bool valid(){
    return (x <= x2) && (y <= y2);
  }
  ll area(){
    return 1LL * (x2 - x + 1) * (y2 - y + 1);
  }
} v[1 + nmax];
mt19937 rng;

int solve(int n, int k){
  shuffle(v + 1, v + n + 1, rng);
  Rect base[1 + sigma];
  for(int i = 1; i <= k; i++)
    base[i] = {1, 1, inf, inf};

  for(int i = 1;i <= n; i++){
    ll smin = 1LL * inf * inf;
    for(int j = 1;j <= k; j++)
      if((base[j] + v[i]).valid())
        smin = min(smin, base[j].area() - (base[j] + v[i]).area());
    if(smin == 1LL * inf * inf)
      return 0;

    for(int j = 1;j <= k; j++)
      if((base[j] + v[i]).valid() && base[j].area() - (base[j] + v[i]).area() == smin) {
         base[j] = base[j] + v[i];
         break;
      }
  }

  for(int j = 1;j <= k; j++)
    cout << base[j].x << " " << base[j].y << '\n';
  return 1;
}

int main()
{
  ios::sync_with_stdio(0);
  cin.tie(0);

  int n, k;
  cin >> n >> k;
  for(int i = 1;i <= n; i++)
    cin >> v[i].x >> v[i].y >> v[i].x2 >> v[i].y2;
  while(solve(n, k) == 0);
  return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
1.0 / 1.0

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

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 13 ms 384 KB Output is correct
14 Correct 17 ms 512 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 11 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 34 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 9 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 6 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 4 ms 384 KB Output is correct
42 Correct 6 ms 384 KB Output is correct
43 Correct 14 ms 384 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 3 ms 384 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 4 ms 384 KB Output is correct
48 Correct 4 ms 384 KB Output is correct
49 Correct 4 ms 384 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 4 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 6 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 2 ms 384 KB Output is correct

Subtask #5
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 105 ms 3448 KB Output is correct
6 Correct 105 ms 3448 KB Output is correct
7 Correct 135 ms 3516 KB Output is correct
8 Correct 102 ms 3448 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 105 ms 3436 KB Output is correct
6 Correct 196 ms 3576 KB Output is correct
7 Correct 109 ms 3396 KB Output is correct
8 Correct 119 ms 3576 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 130 ms 3448 KB Output is correct
14 Correct 128 ms 3404 KB Output is correct
15 Correct 185 ms 3448 KB Output is correct
16 Correct 148 ms 3448 KB Output is correct
17 Correct 139 ms 3448 KB Output is correct
18 Correct 198 ms 3448 KB Output is correct
19 Correct 119 ms 3400 KB Output is correct
20 Correct 273 ms 3516 KB Output is correct
21 Correct 122 ms 3400 KB Output is correct
22 Correct 208 ms 3448 KB Output is correct
23 Correct 135 ms 3448 KB Output is correct
24 Correct 109 ms 3500 KB Output is correct

Subtask #8
0 / 79.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 13 ms 384 KB Output is correct
14 Correct 17 ms 512 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 11 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 34 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 9 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 6 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 4 ms 384 KB Output is correct
42 Correct 6 ms 384 KB Output is correct
43 Correct 14 ms 384 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 3 ms 384 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 4 ms 384 KB Output is correct
48 Correct 4 ms 384 KB Output is correct
49 Correct 4 ms 384 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 4 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 6 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 115 ms 3448 KB Output is correct
60 Correct 208 ms 3412 KB Output is correct
61 Correct 233 ms 3508 KB Output is correct
62 Correct 138 ms 3448 KB Output is correct
63 Correct 203 ms 3448 KB Output is correct
64 Correct 129 ms 3448 KB Output is correct
65 Correct 599 ms 3516 KB Output is correct
66 Correct 274 ms 3448 KB Output is correct
67 Correct 692 ms 3636 KB Output is correct
68 Correct 1219 ms 3524 KB Output is correct
69 Correct 131 ms 3448 KB Output is correct
70 Correct 165 ms 3464 KB Output is correct
71 Correct 171 ms 3524 KB Output is correct
72 Correct 307 ms 3448 KB Output is correct
73 Correct 288 ms 3520 KB Output is correct
74 Correct 292 ms 3468 KB Output is correct
75 Execution timed out 3081 ms 3448 KB Time limit exceeded
76 Halted 0 ms 0 KB -