oj.uz

답안 #234676

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

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];

int main()
{
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  ios::sync_with_stdio(0);
  cin.tie(0);

  int n, k;
  cin >> n >> k;
  vector<Rect> basic, high;
  for(int i = 1;i <= n; i++) {
    cin >> v[i].x >> v[i].y >> v[i].x2 >> v[i].y2;
    basic.push_back(v[i]);
  }

  Rect base[1 + sigma];

  while(true){
    vector<Rect> ord;
    ord.insert(ord.end(), high.begin(), high.end());
    ord.insert(ord.end(), basic.begin(), basic.end());
    high.clear();
    basic.clear();

    for(int j = 1;j <= k; j++)
      base[j] = {1, 1, inf, inf};

    for(int i = 0; i < ord.size(); i++){
      Rect &curr = ord[i];
      bool found = 0;
      for(int j = 1;j <= k; j++){
        Rect newp = curr + base[j];
        if(newp.valid()) {
          found = 1;
          base[j] = base[j] + curr;
          basic.push_back(curr);
          break;
        }
      }
      if(found == 0)
        high.push_back(curr);
    }

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

Compilation message

hamburg.cpp: In function 'int main()':
hamburg.cpp:63:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Rect>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for(int i = 0; i < ord.size(); i++){
      |                    ~~^~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 384 KB Output is correct

Subtask #3
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 2 ms 512 KB Output is correct
4 Correct 3 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 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 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 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 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 2 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 512 KB Output is correct
40 Correct 2 ms 512 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 2 ms 384 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 2 ms 512 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 2 ms 512 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 512 KB Output is correct
54 Correct 2 ms 512 KB Output is correct
55 Correct 2 ms 512 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 1 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 102 ms 9824 KB Output is correct
6 Correct 99 ms 9824 KB Output is correct
7 Correct 103 ms 9872 KB Output is correct
8 Correct 123 ms 9816 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 119 ms 9956 KB Output is correct
6 Correct 112 ms 10540 KB Output is correct
7 Correct 114 ms 11708 KB Output is correct
8 Correct 112 ms 9932 KB Output is correct

Subtask #7
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 2 ms 512 KB Output is correct
4 Correct 3 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 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 111 ms 9800 KB Output is correct
14 Correct 112 ms 10792 KB Output is correct
15 Correct 115 ms 10172 KB Output is correct
16 Correct 127 ms 10136 KB Output is correct
17 Correct 106 ms 9808 KB Output is correct
18 Correct 106 ms 9824 KB Output is correct
19 Correct 117 ms 11544 KB Output is correct
20 Correct 114 ms 10720 KB Output is correct
21 Correct 117 ms 11568 KB Output is correct
22 Correct 111 ms 11340 KB Output is correct
23 Correct 120 ms 10144 KB Output is correct
24 Correct 107 ms 10548 KB Output is correct

Subtask #8
0 / 79.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 512 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 2 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 512 KB Output is correct
40 Correct 2 ms 512 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 2 ms 384 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 2 ms 512 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 2 ms 512 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 512 KB Output is correct
54 Correct 2 ms 512 KB Output is correct
55 Correct 2 ms 512 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 156 ms 10656 KB Output is correct
60 Correct 120 ms 9952 KB Output is correct
61 Correct 104 ms 9864 KB Output is correct
62 Correct 116 ms 9900 KB Output is correct
63 Correct 115 ms 10556 KB Output is correct
64 Correct 104 ms 9820 KB Output is correct
65 Correct 144 ms 11488 KB Output is correct
66 Correct 112 ms 10284 KB Output is correct
67 Correct 110 ms 10748 KB Output is correct
68 Correct 154 ms 10668 KB Output is correct
69 Correct 165 ms 10592 KB Output is correct
70 Correct 154 ms 10640 KB Output is correct
71 Correct 139 ms 11304 KB Output is correct
72 Correct 126 ms 10708 KB Output is correct
73 Correct 128 ms 10652 KB Output is correct
74 Correct 116 ms 11312 KB Output is correct
75 Correct 119 ms 10688 KB Output is correct
76 Correct 117 ms 11272 KB Output is correct
77 Correct 128 ms 11408 KB Output is correct
78 Correct 132 ms 10812 KB Output is correct
79 Correct 138 ms 10832 KB Output is correct
80 Correct 111 ms 10720 KB Output is correct
81 Correct 122 ms 11360 KB Output is correct
82 Correct 113 ms 10692 KB Output is correct
83 Correct 123 ms 10664 KB Output is correct
84 Correct 126 ms 10596 KB Output is correct
85 Correct 124 ms 11456 KB Output is correct
86 Correct 136 ms 11432 KB Output is correct
87 Correct 133 ms 11360 KB Output is correct
88 Correct 137 ms 10208 KB Output is correct
89 Correct 110 ms 10044 KB Output is correct
90 Correct 136 ms 11560 KB Output is correct
91 Correct 119 ms 10664 KB Output is correct
92 Correct 182 ms 11560 KB Output is correct
93 Correct 110 ms 10032 KB Output is correct
94 Correct 111 ms 10664 KB Output is correct
95 Correct 125 ms 11308 KB Output is correct
96 Execution timed out 3029 ms 12840 KB Time limit exceeded
97 Halted 0 ms 0 KB -