oj.uz

Submission #981421

# Submission time Handle Problem Language Result Execution time Memory
981421 2024-05-13T07:22:58 Z Faisal_Saqib Hexagonal Territory (APIO21_hexagon) C++17
3 / 100
 0 ms 416 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;
  ll ans=(total_cell*ap)%mod;
  // cell with distance i are i+1
  // So (i*b)*(i+1)
  // Sum of ((i*(i+1))) *b
  ll app=total_cell*(total_cell-1);
  app%=mod;
  app*=(total_cell+1);
  app%=mod;
  app=(app*powmod(3,mod-2,mod))%mod;
  ll pb=B;
  ll po=(app*pb)%mod;
  // (i+1 C 2) = 2**(i+2)
  ans=(ans+po)%mod;
  return ans;
  // return (total_cell*ap)%mod;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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

Subtask #2
0 / 6.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 416 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -