답안 #981407

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
981407 2024-05-13T07:14:44 Z Faisal_Saqib 육각형 영역 (APIO21_hexagon) C++17
3 / 100
1 ms 372 KB
#include "hexagon.h"
//#include "grader.cpp"
#include <vector>
using namespace std;
#define ll long long
const ll mod=1e9+7;
ll powmod(ll a,ll b,ll mod)
{
  if(b==0)
  {
    return 1;
  }
  if(b==1)
  {
    return a;
  }
  ll cp=powmod(a,b/2,mod);
  cp=(cp*cp)%mod;
  if(b%2)
  {
    cp=(cp*a)%mod;
  }
  return cp;
}
int draw_territory(int N, int A, int B,std::vector<int> D, std::vector<int> L) {
  ll total_cell=L[0]+1,two=2;
  total_cell=(((total_cell*(total_cell+1))%mod)*powmod(two,mod-2,mod))%mod;
  ll ap=A;
  return (total_cell*ap)%mod;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 372 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -