oj.uz

답안 #1063828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1063828 2024-08-18T03:55:08 Z 12345678 육각형 영역 (APIO21_hexagon) C++17
3 / 100
 1 ms 352 KB 
#include "hexagon.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int mod=1e9+7;

ll a, b, k;

ll binpow(ll vl, ll idx)
{
    if (idx==0) return 1;
    ll tmp=binpow(vl, idx/2);
    if (idx%2) return (((tmp*tmp)%mod)*vl)%mod;
    else return (tmp*tmp)%mod;
}

int draw_territory(int N, int A, int B, std::vector<int> D, std::vector<int> L) {
    a=A, b=B, k=L[0]+1;
    ll x=((((k)*(k+1)/2)%mod)*a)%mod;
    ll y=(((((((b*k)%mod)*(k+1))%mod)*(2*k+1))%mod)*binpow(6, mod-2))%mod;
    return (x+y)%mod;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 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 -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 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 -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -