oj.uz

답안 #51319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
51319 2018-06-17T13:08:42 Z mareksom Spiral (BOI16_spiral) C++17
12 / 100
 1500 ms 560 KB 
#ifndef LOCAL
#pragma GCC optimize ("O3")
#endif

#include <bits/stdc++.h>

using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return {i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (c it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(x...) " [" #x ": " << (x) << "] "

using ld = long double;
using ll = long long;

constexpr int mod = 1000 * 1000 * 1000 + 7;
constexpr int odw2 = (mod + 1) / 2;

void OdejmijOd(int& a, int b) { a -= b; if (a < 0) a += mod; }
int Odejmij(int a, int b) { OdejmijOd(a, b); return a; }
void DodajDo(int& a, int b) { a += b; if (a >= mod) a -= mod; }
int Dodaj(int a, int b) { DodajDo(a, b); return a; }
int Mnoz(int a, int b) { return (ll) a * b % mod; }
void MnozDo(int& a, int b) { a = Mnoz(a, b); }
int Pot(int a, int b) { int res = 1; while (b) { if (b % 2 == 1) MnozDo(res, a); a = Mnoz(a, a); b /= 2; } return res; }
int Odw(int a) { return Pot(a, mod - 2); }
void PodzielDo(int& a, int b) { MnozDo(a, Odw(b)); }
int Podziel(int a, int b) { return Mnoz(a, Odw(b)); }
int Moduluj(ll x) { x %= mod; if (x < 0) x += mod; return x; }

template <typename T> T Maxi(T& a, T b) { return a = max(a, b); }
template <typename T> T Mini(T& a, T b) { return a = min(a, b); }

int Get(int x, int y) {
  if (x == 0 and y == 0) return 1;
  const int m = max(abs(x), abs(y)) - 1;
  int wart = Mnoz(m * 2 + 1, m * 2 + 1);
  DodajDo(wart, 1);
  int a = m + 1, b = -m;
  if (a == x and b <= y) {
    return Dodaj(wart, y - b);
  }
  DodajDo(wart, (m + 1) * 2 - 1);
  b += (m + 1) * 2 - 1;
  if (b == y and x < a) {
    return Dodaj(wart, a - x);
  }
  DodajDo(wart, (m + 1) * 2);
  a -= (m + 1) * 2;
  if (a == x and y < b) {
    return Dodaj(wart, b - y);
  }
  DodajDo(wart, (m + 1) * 2);
  b -= (m + 1) * 2;
  if (b == y and a < x) {
    return Dodaj(wart, x - a);
  }
  assert(false);
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    int suma = 0;
    for (int x = x1; x <= x2; x++) {
      for (int y = y1; y <= y2; y++) {
        DodajDo(suma, Get(x, y));
      }
    }
    cout << suma << endl;
  }
  return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 383 ms 248 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 383 ms 248 KB Output is correct
2 Execution timed out 1575 ms 560 KB Time limit exceeded

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1569 ms 560 KB Time limit exceeded

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 383 ms 248 KB Output is correct
2 Incorrect 2 ms 356 KB Output isn't correct