제출 #1202225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1202225		Kavelmydex	육각형 영역 (APIO21_hexagon)	C++20	0 / 100	0 ms	328 KiB

hexagon

/*
I: 
1. The path does not conatin layers. 
Must compute: 
1. the number of cells in the territory. 
======================
======================
*/
#include "hexagon.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long 
#define vi vector<int>  
#define pi pair<int,int>
#define pb push_back
#define sz(x) ((int)x.size())
#define sp ' '
#define endl "\n"
#define all(x) (x).begin(),(x).end()
#define rep(i,x,n) for(int i=x; i<=n; ++i)
#define For(i,n) rep(i,0,n-1)   
#define ff first 
#define ss second
#define ld long double
#define mp make_pair

const int mxN=6e5+10,OO=2e9,mod=1e9+7;  
const int dx[]{0,0,-1,1}, dy[]{1,-1,0,0};

void cmn(int &a,int b){a = min(a,b);}
void cmx(int &a,int b){a = max(a,b);}

int draw_territory(int N, int A, int B,vector<int> D, vector<int> L) {
  ll v=L.back(),ans=v;
  ans = v * (v+1)/2; ans %= mod;
  if(N==3){
    assert(L[0]==L[1]&&L[1]==L[2]);
  }
  return ans;
}

• 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