oj.uz

답안 #569579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
569579 2022-05-27T14:22:18 Z hoanghq2004 육각형 영역 (APIO21_hexagon) C++14
30 / 100
 51 ms 8556 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "hexagon.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int mod = 1e9 + 7;
const int N = 2e5 + 10;

struct Vector {
    long long x, y;
    Vector operator - (const Vector& other) const {
        return {x - other.x, y - other.y};
    }
    long long operator * (const Vector& other) const {
        return x * other.y - y * other.x;
    }
} P[N];

int dx[6] = {0, 1, 1, 0, -1, -1};
int dy[6] = {1, 1, 0, -1, -1, 0};

int power(int a, int n) {
    int ans = 1;
    for (; n; n >>= 1, a = 1LL * a * a % mod)
        if (n & 1) ans = 1LL * ans * a % mod;
    return ans;
}

int draw_territory(int N, int A, int B, vector<int> D, vector<int> L) {
    vector <Vector> P = {{0, 0}};
    long long x = 0, y = 0, b = 0;
    for (int i = 0; i < N; ++i) {
        --D[i];
        x += L[i] * dx[D[i]];
        y += L[i] * dy[D[i]];
//        x = (0LL + x + L[i] * dx[D[i]] + mod) % mod;
//        y = (0LL + y + L[i] * dy[D[i]] + mod) % mod;
        b = (b + L[i]) % mod;
        P.push_back({x, y});
    }
    long long S = 0;
    for (int i = 1; i < P.size(); ++i) S += P[i - 1] * P[i];
//    for (int i = 1; i < P.size(); ++i) S = (S + P[i - 1] * P[i]) % mod;
    S = abs(S);
    S %= mod;
    long long i = ((1LL * (S - b + 2 + mod) * power(2, mod - 2)) + b) % mod;
    return i * A % mod;
}

//
//int main() {
//  int N, A, B;
//  assert(3 == scanf("%d %d %d", &N, &A, &B));
//  std::vector<int> D(N), L(N);
//  for (int i = 0; i < N; ++i) {
//    assert(2 == scanf("%d %d", &D[i], &L[i]));
//  }
//
//  int result = draw_territory(N, A, B, D, L);
//  printf("%d\n", result);
//  return 0;
//}
//
//

Compilation message

hexagon.cpp: In function 'int draw_territory(int, int, int, std::vector<int>, std::vector<int>)':
hexagon.cpp:50:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Vector>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for (int i = 1; i < P.size(); ++i) S += P[i - 1] * P[i];
      |                     ~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 7 ms 1488 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 14 ms 2360 KB Output is correct
12 Correct 10 ms 2428 KB Output is correct
13 Correct 9 ms 2388 KB Output is correct
14 Correct 10 ms 2488 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 7 ms 1488 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 10 ms 2420 KB Output is correct
14 Correct 10 ms 2424 KB Output is correct
15 Correct 9 ms 2360 KB Output is correct
16 Correct 10 ms 2508 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 18 ms 4320 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 1 ms 452 KB Output is correct
23 Correct 21 ms 4896 KB Output is correct
24 Correct 34 ms 7908 KB Output is correct
25 Correct 36 ms 8132 KB Output is correct
26 Correct 19 ms 4440 KB Output is correct
27 Correct 13 ms 2872 KB Output is correct
28 Correct 12 ms 2360 KB Output is correct
29 Correct 51 ms 8404 KB Output is correct
30 Correct 41 ms 8404 KB Output is correct
31 Correct 43 ms 8556 KB Output is correct
32 Correct 42 ms 8340 KB Output is correct
33 Correct 25 ms 4492 KB Output is correct
34 Correct 10 ms 2472 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 312 KB Output is correct

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -