제출 #643256

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
643256		fatemetmhr	Spiral (BOI16_spiral)	C++17	15 / 100	1 ms	212 KiB

spiral

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb       push_back
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn5 = 1e5 + 10;
const int inf   = 1e9;
const int mod   = 1e9 + 7;
const ll  mod10 = 10000000070;


inline ll get(ll x, ll y){
    if(x == 0 && y == 0)
        return 1;
    if(x >= 0 && y < 0){
        if(x == -y)
            return ((2 * x + 1) % mod) * ((2 * x + 1) % mod) % mod;
        if(x < -y)
            return (mod10 + get(-y, y) - (((-y) - x) % mod)) % mod;
        return (get(x - 1, -(x - 1)) + x + y + mod10) % mod;
    }
    if(x < 0 && y <= 0){
        if(x == y)
            return (get(-x, y) + 2 * x + mod10) % mod;
        if(x < y)
            return (get(x, x) - (-x + y) + mod10) % mod;
        return (get(y, y) + (-y + x) + mod10) % mod;
    }
    if(x <= 0 && y > 0){
        if(-x == y)
            return (get(x, x) + 2 * x + mod10) % mod;
        if(-x > y)
            return (get(x, -x) + (-x - y) + mod10) % mod;
        return (get(-y, y) - (y + x) + mod10) % mod;
    }
    if(x > 0 && y >= 0){
        if(x == y)
            return (get(-x, x) - 2 * x + mod10) % mod;
        if(x < y)
            return (get(y, y) + y - x + mod10) % mod;
        return (get(x, x) - (x - y) + mod10) % mod;
    }
    cout << "WTF " << endl;
    cout << 1 / 0 << endl;
    return -1;
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    /*
    for(int i = 5; i >= -5; i--){
        for(int j = -5; j <= 5; j++)
            cout << get(j, i) << ' ';
        cout << endl;
    }
    return 0;
    //*/

    ll n, q; cin >> n >> q;
    while(q--){
        ll x, y; cin >> x >> y >> x >> y;
        cout << get(x, y) % mod << '\n';
    }
}

컴파일 시 표준 에러 (stderr) 메시지

spiral.cpp: In function 'll get(ll, ll)':
spiral.cpp:50:15: warning: division by zero [-Wdiv-by-zero]
   50 |     cout << 1 / 0 << endl;
      |             ~~^~~

• Subtask 1: 0 / 12
• Subtask 2: 15 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 31
• Subtask 5: 0 / 25