제출 #567068

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
567068		Bill_00	육각형 영역 (APIO21_hexagon)	C++14	3 / 100	9 ms	1284 KiB

hexagon

#include "hexagon.h"
#include <bits/stdc++.h>
#include <vector>
typedef long long ll;
const ll MOD = 1000000007;
const ll low = -1000000000;
using namespace std;

ll area, bound, x, y;
int draw_territory(int N, int A, int B, vector<int> D, vector<int> L){
    if(B == 0){
        for(int i = 0; i < N; i++){
            ll val = L[i];
            bound += val;
            bound %= MOD;
            if(D[i] == 1){
                y += val;
            }
            if(D[i] == 2){
                area += ((2 * y * val) % MOD);
                area %= MOD;
                x += val;
            }
            if(D[i] == 3){
                area += (((2 * y - val) * val) % MOD);
                area %= MOD;
                x += val;
                y -= val;
            }
            if(D[i] == 4){
                y -= val;
            }
            if(D[i] == 5){
                area -= ((2 * y * val) % MOD);
                area %= MOD;
                x -= val;
            }
            if(D[i] == 6){
                area -= (((2 * y + val) * val) % MOD);
                area %= MOD;
                x -= val;
                y += val;
            }
        }
        // cout << area << "\n";
        if(area < 0) area = (MOD - (area % MOD)) % MOD;
        // if(area != (L[0] * L[0])) while(1);
        // cout << area << '\n';
        ll inter = (area + 2 - bound);
        if(inter % 2 == 1) inter = (inter + MOD) / 2;
        else inter /= 2;
        inter %= MOD;

        return (((inter + bound) * (ll)(A)) % MOD);
    }
    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 15
• Subtask 6: 0 / 19
• Subtask 7: 0 / 18
• Subtask 8: 0 / 16