| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1287322 | sasde | Hexagonal Territory (APIO21_hexagon) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.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 int long long
#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
{
int x,y;
point2d (){}
point2d(int x,int 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*(int k) const{return point2d(x*k,y*k);}
point2d operator/(int k) const{return point2d(x/k,y/k);}
};
ii a[N];
int cross(point2d a,point2d b){
return a.x*b.y-a.y*b.x;
}
int dt(vector<point2d> v){
int 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;
void solve(){
cin >> node;
for(int i=1;i<=node;++i){
cin >> a[i].fi >> a[i].se;
a[i].fi--;
}
vector<point2d>x;
x.emb(0,0);
int B=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;
B+=a[i].se;
// cout <<g.x<<" "<<g.y<<" "<<x.back().x<<" "<<x.back().y<<'\n';
x.emb(g);
}
int val=dt(x);
// cout << val<<" "<<B<<'\n';
int I=val-B+2;
I/=2;
cout <<(B+I)%mod;
//2S=2*I+B-2
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#define task "aws"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
}
look_memory;
look_time;
}