oj.uz

Submission #234674

# Submission time Handle Problem Language Result Execution time Memory
234674 2020-05-25T06:26:12 Z AlexLuchianov Hamburg Steak (JOI20_hamburg) C++14
21 / 100
 3000 ms 3600 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];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int solve(int n, int k, int mode){
  shuffle(v + 1, v + n + 1, rng);
  Rect base[1 + sigma];
  for(int i = 1; i <= k; i++)
    base[i] = {1, 1, inf, inf};
  if(mode == 1){
    for(int i = 1;i <= n; i++){
      ll smin = 1LL * inf * inf;
      for(int j = 1;j <= k; j++) {
        Rect newp = base[j] + v[i];
        if(newp.valid())
          smin = min(smin, base[j].area() - newp.area());
      }

      if(smin == 1LL * inf * inf)
        return 0;

      for(int j = 1;j <= k; j++) {
        Rect newp = base[j] + v[i];
        if(newp.valid() && base[j].area() - newp.area() == smin) {
           base[j] = newp;
           break;
        }
      }
    }
  } else {
    for(int i = 1;i <= n; i++) {
      bool found = 0;
      for(int j = 1;j <= k; j++){
        Rect newp = base[j] + v[i];
        if(newp.valid()) {
          base[j] = newp;
          found = 1;
          break;
        }
      }
      if(found == 0)
        return 0;
    }
  }

  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;
  int era = 0;
  while(true){
    if(solve(n, k, era + 1) == 1)
      return 0;
    era = !era;
  }
  return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory 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 416 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 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

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory 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 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 384 KB Output is correct
9 Correct 3 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 2 ms 384 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory 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 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 12 ms 384 KB Output is correct
11 Correct 24 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 36 ms 384 KB Output is correct
16 Correct 29 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 14 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 26 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 31 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 28 ms 384 KB Output is correct
34 Correct 17 ms 384 KB Output is correct
35 Correct 10 ms 384 KB Output is correct
36 Correct 15 ms 384 KB Output is correct
37 Correct 11 ms 384 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 15 ms 384 KB Output is correct
40 Correct 13 ms 384 KB Output is correct
41 Correct 3 ms 384 KB Output is correct
42 Correct 7 ms 384 KB Output is correct
43 Correct 12 ms 384 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 7 ms 384 KB Output is correct
46 Correct 25 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 4 ms 428 KB Output is correct
49 Correct 9 ms 384 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 11 ms 416 KB Output is correct
52 Correct 13 ms 384 KB Output is correct
53 Correct 35 ms 384 KB Output is correct
54 Correct 6 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

# Verdict Execution time Memory 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 416 KB Output is correct
5 Correct 108 ms 3520 KB Output is correct
6 Correct 102 ms 3448 KB Output is correct
7 Correct 108 ms 3496 KB Output is correct
8 Correct 111 ms 3520 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 136 ms 3524 KB Output is correct
6 Correct 100 ms 3428 KB Output is correct
7 Correct 105 ms 3448 KB Output is correct
8 Correct 114 ms 3448 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory 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 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 384 KB Output is correct
9 Correct 3 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 2 ms 384 KB Output is correct
13 Correct 238 ms 3460 KB Output is correct
14 Correct 113 ms 3396 KB Output is correct
15 Correct 107 ms 3448 KB Output is correct
16 Correct 519 ms 3440 KB Output is correct
17 Correct 231 ms 3520 KB Output is correct
18 Correct 143 ms 3400 KB Output is correct
19 Correct 383 ms 3600 KB Output is correct
20 Correct 111 ms 3448 KB Output is correct
21 Correct 183 ms 3516 KB Output is correct
22 Correct 132 ms 3436 KB Output is correct
23 Correct 128 ms 3448 KB Output is correct
24 Correct 211 ms 3576 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory 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 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 12 ms 384 KB Output is correct
11 Correct 24 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 36 ms 384 KB Output is correct
16 Correct 29 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 14 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 26 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 31 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 28 ms 384 KB Output is correct
34 Correct 17 ms 384 KB Output is correct
35 Correct 10 ms 384 KB Output is correct
36 Correct 15 ms 384 KB Output is correct
37 Correct 11 ms 384 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 15 ms 384 KB Output is correct
40 Correct 13 ms 384 KB Output is correct
41 Correct 3 ms 384 KB Output is correct
42 Correct 7 ms 384 KB Output is correct
43 Correct 12 ms 384 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 7 ms 384 KB Output is correct
46 Correct 25 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 4 ms 428 KB Output is correct
49 Correct 9 ms 384 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 11 ms 416 KB Output is correct
52 Correct 13 ms 384 KB Output is correct
53 Correct 35 ms 384 KB Output is correct
54 Correct 6 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 222 ms 3448 KB Output is correct
60 Correct 168 ms 3448 KB Output is correct
61 Correct 162 ms 3448 KB Output is correct
62 Correct 210 ms 3448 KB Output is correct
63 Correct 477 ms 3416 KB Output is correct
64 Correct 229 ms 3516 KB Output is correct
65 Correct 198 ms 3520 KB Output is correct
66 Correct 168 ms 3580 KB Output is correct
67 Correct 189 ms 3576 KB Output is correct
68 Execution timed out 3068 ms 3552 KB Time limit exceeded
69 Halted 0 ms 0 KB -