| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1286899 | longdeptrai | 육각형 영역 (APIO21_hexagon) | C++17 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define LongDepTrai "hexagon"
#define ll long long
#define ull unsigned long long
#define ld long double
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define pll pair<ll,ll>
#define vi vector<int>
#define vii vector<ii>
#define vll vector<ll>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) int((x).size())
#define order_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
inline ll add(ll a, ll b, ll mod){ a += b; if(a >= mod) a -= mod; return a; }
inline ll sub(ll a, ll b, ll mod){ a -= b; if(a < 0) a += mod; return a; }
inline ll mul(ll a, ll b, ll mod){ return ( (ll)a * b ) % mod; }
static mt19937_64 rng((unsigned)chrono::steady_clock::now().time_since_epoch().count());
const int N=1e5+9;
const int mod=1e9+7;
int n,sum=0;
vii v;
int dist(ii u,ii v){
return abs(u.fi-v.fi)+abs(u.se-v.se);
}
ll area2(const vector<ii>& p) {
int n = p.size();
ll res = 0;
for (int i = 0; i < n; i++) {
int j = (i + 1) % n;
res += p[i].fi * p[j].se - p[j].fi * p[i].se;
}
return abs(res);
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n;
v.pb({0,0});
for(int i=1;i<=n;i++){
int d,k;
cin>>d>>k;
ii pre=v.back();
ii pos=pre;
if(d==1){
pos.se+=k;
}
if(d==2){
pos.fi+=k;
}
if(d==3){
pos.fi+=k;
pos.se-=k;
}
if(d==4){
pos.se-=k;
}
if(d==5){
pos.fi-=k;
}
if(d==6){
pos.fi-=k;
pos.se+=k;
}
v.pb(pos);
sum+=k;
// cout<<pos.fi<<" "<<pos.se<<"\n";
}
int S=area2(v);
// cout<<sum<<" ";
cout<<S+1;
return 0;
}