oj.uz

답안 #1052986

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1052986 2024-08-11T07:16:18 Z caterpillow Spiral (BOI16_spiral) C++17
15 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

using db = long double;
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end() 
#define size(x) ((int) (x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;

template<typename... Args> // tuples
ostream& operator<<(ostream& os, tuple<Args...> t) { 
    apply([&](Args... args) { string dlm = "{"; ((os << dlm << args, dlm = ", "), ...); }, t);
    return os << "}";
}

template<typename T, typename V> // pairs
ostream& operator<<(ostream& os, pair<T, V> p) { return os << "{" << p.f << ", " << p.s << "}"; }

template<class T, class = decltype(begin(declval<T>()))> // iterables
typename enable_if<!is_same<T, string>::value, ostream&>::type operator<<(ostream& os, const T& v) {
    string dlm = "{";
    for (auto& i : v) os << dlm << i, dlm = ", ";
    return os << "}";  
}

template <typename T, typename... V>
void printer(string pfx, const char *names, T&& head, V&& ...tail) {
    int i = 0;
    while (names[i] && names[i] != ',') i++;
    constexpr bool is_str = is_same_v<decay_t<T>, const char*>;
    if (is_str) cerr << " " << head;
    else cerr << pfx, cerr.write(names, i) << " = " << head; 
    if constexpr (sizeof...(tail)) printer(is_str ? "" : ",", names + i + 1, tail...);
    else cerr << endl;
}

#ifdef LOCAL
#define dbg(...) printer(to_string(__LINE__) + ": ", #__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(x...)
#define cerr if (0) std::cerr
#endif

const ll mod = 1e9 + 7;
void add(ll& a, ll b) {
    a = (a + b) % mod;
}

/*

subtask 1: just do it
subtask 2: find the size of the inner ring, and then math how many extra squares around the outside you are
subtask 3: 

*/

ll n, q;

ll dist(pl a, pl b) {
    return abs(a.f - b.f) + abs(a.s - b.s);
}

main() {
    cin.tie(0)->sync_with_stdio(0);
    
    cin >> n >> q;
    F0R (i, q) {
        ll x, y, x2, y2; 
        cin >> x >> y >> x2 >> y2;
        ll layers = max(abs(x), abs(y));
        ll w = 2 * layers;
        vt<pl> pts {
            {layers, -layers + 1},
            {layers, layers},
            {-layers, layers},
            {-layers, -layers}, 
            {layers, -layers}
        };
        pl query = {x, y};
        ll ans = (w - 1) * (w - 1) % mod;
        F0R (i, 4) {
            if (dist(pts[i], pts[i + 1]) == dist(pts[i], query) + dist(query, pts[i + 1])) {
                ans += dist(pts[i], query) + (i == 0);
                break;
            }
            ans += w;
        }
        ans %= mod;
        cout << ans << endl;
    }
}

Compilation message

spiral.cpp:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 | main() {
      | ^~~~

Subtask #1
0 / 12.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 17.0

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

Subtask #4
0 / 31.0

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

Subtask #5
0 / 25.0

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