oj.uz

Submission #412305

# Submission time Handle Problem Language Result Execution time Memory
412305 2021-05-26T17:04:08 Z model_code Hexagonal Territory (APIO21_hexagon) C++17
30 / 100
 58 ms 4936 KB 
#include "hexagon.h"
#include <bits/stdc++.h>

using namespace std;

struct Point {
  int x, y;
  Point(int _x = 0, int _y = 0) : x(_x), y(_y) {}
  Point operator+(Point p) const { return Point(x+p.x, y+p.y); }
  Point operator-(Point p) const { return Point(x-p.x, y-p.y); }
  Point operator*(int s) const { return Point(x * s, y * s); }
  bool operator==(Point p) const { return x == p.x && y == p.y; }
  bool operator<(Point p) const { return x == p.x ? y < p.y : x < p.x; }
};

ostream& operator<<(ostream& os, Point p) {
  return os << "(" << p.x << ", " << p.y << ")";
}

constexpr int mod = 1e9 + 7;
const vector<Point> pdirs = { Point(0, 1), Point(1, 1), Point(1, 0),
                              Point(0, -1), Point(-1, -1), Point(-1, 0) };

long long signed_twice_area(vector<Point> & vp) {
  long long ret = 0;
  int n = (int)vp.size() - 1;
  for (int i = 0; i < n; ++i) {
    ret += 1LL * vp[i].x * vp[i+1].y - 1LL * vp[i+1].x * vp[i].y;
  }
  return ret;
}

int draw_territory(int N, int A, int /*B*/, vector<int> D, vector<int> L) {
  vector<Point> vp(N+1);
  for (int i = 0; i < N; ++i) {
    vp[i+1] = vp[i] + pdirs[D[i]-1] * L[i];
  }
  long long boundary = accumulate(L.begin(), L.end(), 0LL);
  long long inside = (abs(signed_twice_area(vp)) - boundary) / 2 + 1;
  long long ans = boundary + inside;
  ans = (ans % mod) * A % mod;
  if (ans < 0)
    ans += mod;
  return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 2 ms 304 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 4 ms 488 KB Output is correct
7 Correct 7 ms 972 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 10 ms 1404 KB Output is correct
12 Correct 11 ms 1456 KB Output is correct
13 Correct 10 ms 1308 KB Output is correct
14 Correct 14 ms 1484 KB Output is correct
15 Correct 2 ms 204 KB Output is correct
16 Correct 2 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 216 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 7 ms 972 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 12 ms 1356 KB Output is correct
14 Correct 12 ms 1356 KB Output is correct
15 Correct 9 ms 1308 KB Output is correct
16 Correct 11 ms 1400 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 19 ms 2072 KB Output is correct
21 Correct 3 ms 460 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 21 ms 2812 KB Output is correct
24 Correct 49 ms 4320 KB Output is correct
25 Correct 37 ms 4544 KB Output is correct
26 Correct 20 ms 2412 KB Output is correct
27 Correct 14 ms 1740 KB Output is correct
28 Correct 9 ms 1228 KB Output is correct
29 Correct 41 ms 4896 KB Output is correct
30 Correct 58 ms 4928 KB Output is correct
31 Correct 38 ms 4932 KB Output is correct
32 Correct 43 ms 4936 KB Output is correct
33 Correct 19 ms 2452 KB Output is correct
34 Correct 12 ms 1312 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -