結果
問題 | No.8059 tan |
ユーザー | Shuz* |
提出日時 | 2020-04-01 22:11:24 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 5,330 bytes |
コンパイル時間 | 1,505 ms |
コンパイル使用メモリ | 170,384 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-27 11:06:48 |
合計ジャッジ時間 | 1,886 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;// Defineusing ll = long long;using ull = unsigned long long;using ld = long double;template <class T> using pvector = vector<pair<T, T>>;template <class T>using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;constexpr const ll dx[4] = {1, 0, -1, 0};constexpr const ll dy[4] = {0, 1, 0, -1};constexpr const ll MOD = 1e9 + 7;constexpr const ll mod = 998244353;constexpr const ll INF = 1LL << 60;constexpr const ll inf = 1 << 30;constexpr const char rt = '\n';constexpr const char sp = ' ';#define mp make_pair#define mt make_tuple#define pb push_back#define eb emplace_back#define elif else if#define all(a, v, ...) \([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)#define rall(a, v, ...) \([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)#define fi first#define se secondtemplate <class T> bool chmax(T &a, const T &b) {if (a < b) {a = b;return 1;}return 0;}template <class T> bool chmin(T &a, const T &b) {if (a > b) {a = b;return 1;}return 0;}// Debug#define debug(...) \{ \cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] "; \cerr << rt; \}#define dump(a, h, w) \{ \cerr << __LINE__ << ": " << #a << " = [" << rt; \rep(_i, h) { \rep(_j, w) cerr << a[_i][_j] << sp; \cerr << rt; \} \cerr << "]" << rt; \}#define vdump(a, n) \{ \cerr << __LINE__ << ": " << #a << " = ["; \rep(_i, n) if (_i) cerr << sp << a[_i]; \else cerr << a[_i]; \cerr << "]" << rt; \}// Loop#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)#define each(i, a) for (auto &&i : a)// Stream#define fout(n) cout << fixed << setprecision(n)struct io {io() { cin.tie(nullptr), ios::sync_with_stdio(false); }} io;// Speed#pragma GCC optimize("Ofast")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")// Mathinline constexpr ll gcd(const ll a, const ll b) {return b ? gcd(b, a % b) : a;}inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }inline constexpr ll modulo(const ll n, const ll m = MOD) {ll k = n % m;return k + m * (k < 0);}inline constexpr ll chmod(ll &n, const ll m = MOD) {n %= m;return n += m * (n < 0);}inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {ll r = 1;rep(i, 64) {if (n & (1LL << i)) r *= a;chmod(r, m);a *= a;chmod(a, m);}return r;}inline ll inv(const ll n, const ll m = MOD) {ll a = n, b = m, x = 1, y = 0;while (b) {ll t = a / b;a -= t * b;swap(a, b);x -= t * y;swap(x, y);}return modulo(x, m);}struct bfs {typedef pair<ll, ll> P;#define x first#define y second#define MAX_N 1000#define MAX_M 1000string maze[MAX_N];P start, goal;ll N, M;ll D[MAX_N][MAX_M];ll BFS() {queue<P> Q;rep(i, N) rep(j, M) D[i][j] = INF;Q.push(start);D[start.x][start.y] = 0;while (!Q.empty()) {P now = Q.front();Q.pop();if (now.x == goal.x && now.y == goal.y) break;rep(i, 4) {P next = make_pair(now.x + dx[i], now.y + dy[i]);if (0 <= next.x && next.x < N && 0 <= next.y && next.y < M)if (maze[next.x][next.y] != '#' &&D[next.x][next.y] == INF) {Q.push(next);D[next.x][next.y] = D[now.x][now.y] + 1;}}}return D[goal.x][goal.y];}};signed main() {ll N;cin >> N;rep(i, N) {ll A;cin >> A;if (A == 0 or A == 45)cout << 'Y' << rt;elsecout << 'N' << rt;}}// -g -D_GLIBCXX_DEBUG -fsanitize=undefined