Submission #1287332

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287332		sasde	육각형 영역 (APIO21_hexagon)	C++20	0 / 100	1 ms	572 KiB

hexagon

#include<bits/stdc++.h>
#include "hexagon.h"
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time   cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e6+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
 return u+rd()%(v-u+1);
}
int dx[]={0,1,1,0,-1,-1};
int dy[]={1,0,-1,-1,0,1};
int node;
struct point2d
{
    long long x,y;
    point2d (){}
    point2d(long long x,long long y):x(x),y(y){}
    point2d operator +(point2d t){
        return point2d(x+t.x,y+t.y);
    }
    point2d operator-(point2d t){
        return point2d(x-t.x,y-t.y);
    }
    friend bool operator<(point2d x,point2d y){
        return x.x<y.x||(x.x==y.x&&x.y<y.y);
    }
    friend bool operator==(point2d x,point2d y){
      return x.x==y.x&&x.y==y.y;
    }
    point2d operator*(long long k) const{return point2d(x*k,y*k);}
    point2d operator/(long long k) const{return point2d(x/k,y/k);}
};
ii a[N];
long long cross(point2d a,point2d b){
    return a.x*b.y-a.y*b.x;
}
long long dt(vector<point2d> v){
    long long res=0;
    for(int i=0;i<v.size();i++){
        res+=cross(v[i],v[(i + 1)%v.size()]);
        // cout <<res<<'\n';
        // res%=mod;
    }
    return abs(res);
}
bool M2;

int draw_territory(int node,int A,int B,vector<int>D,vector<int>L){
    for(int i=1;i<=node;++i){
        a[i].se=L[i-1];
        a[i].fi--;
    }
    vector<point2d>x;
    x.emb(0,0);
    long long giatri=0;
    for(int i=1;i<=node;++i){
       point2d g=x.back();
       g.x+=dx[a[i].fi]*a[i].se;
       g.y+=dy[a[i].fi]*a[i].se;
       giatri+=a[i].se;
       // cout <<g.x<<" "<<g.y<<" "<<x.back().x<<" "<<x.back().y<<'\n';
       x.emb(g);
    }
    long long val=dt(x);
    // cout << val<<" "<<B<<'\n';
    long long I=val-giatri+2;
    I/=2;
    int ans=(1LL*giatri*A%mod+1LL*I*B%mod)%mod;
    return ans;    
    //2S=2*I+B-2
}

• Subtask 1: 0 / 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