結果
問題 | No.401 数字の渦巻き |
ユーザー |
|
提出日時 | 2022-12-15 11:10:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,259 bytes |
コンパイル時間 | 3,486 ms |
コンパイル使用メモリ | 204,332 KB |
最終ジャッジ日時 | 2025-02-09 13:53:20 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;//#include <atcoder/all>//using namespace atcoder;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vvvvll = vector<vvvll>;using vvvvvll = vector<vvvvll>;using vvvvvvll = vector<vvvvvll>;using vb = vector<bool>;using vvb = vector<vb>;using vvvb = vector<vvb>;using vvvvb = vector<vvvb>;using vd = vector<double>;using vvd = vector<vd>;using vvvd = vector<vvd>;using vvvvd = vector<vvvd>;using vvvvvd = vector<vvvvd>;#define all(A) A.begin(),A.end()#define ALL(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll gcd(ll(a), ll(b)) {if (a == 0)return b;if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}ll sqrtz(ll N) {ll L = 0;ll R = sqrt(N) + 10000;while (abs(R - L) > 1) {ll mid = (R + L) / 2;if (mid * mid <= N)L = mid;else R = mid;}return L;}/*using mint = modint998244353;//using Mint = modint;vector<mint> fact, factinv, inv;const ll mod = 998244353;void prenCkModp(ll n) {fact.resize(n + 5);factinv.resize(n + 5);inv.resize(n + 5);fact[0] = fact[1] = 1;factinv[0] = factinv[1] = 1;inv[1] = 1;for (ll i = 2; i < n + 5; i++) {fact[i] = (fact[i - 1] * i);inv[i] = mod - (inv[mod % i] * (mod / i));factinv[i] = (factinv[i - 1] * inv[i]);}}mint nCk(ll n, ll k) {if (n < k || k < 0) return 0;return fact[n] * (factinv[k] * factinv[n - k]);}*/template<class T>vector<vector<T>> mul(vector<vector<T>> A, vector<vector<T>> B) {ll N = A.size();vector<vector<T>> res(N, vector<T>(N, 0));rep(i, N)rep(j, N)rep(k, N) {res[i][j] += A[i][k] * B[k][j];}return res;}vll S(vll V,ll A){A--;vll res;res.push_back(V[A]);rep(i,V.size()){if(i!=A)res.push_back(V[i]);}return res;}int main() {ios_base::sync_with_stdio(false);cin.tie(nullptr);ll N;cin>>N;vvll A(N,vll(N,-1));vll dy={0,1,0,-1};vll dx={1,0,-1,0};ll d=0;if(N==1){cout<<"001"<<endl;return 0;}ll y=0,x=0;rep(i,N*N){A[y][x]=i+1;ll ny=y+dy[d];ll nx=x+dx[d];if(max(ny,nx)>=N||min(ny,nx)<0){d=(d+1)%4;ny=y+dy[d];nx=x+dx[d];}else if(A[ny][nx]!=-1){d=(d+1)%4;ny=y+dy[d];nx=x+dx[d];}y=ny;x=nx;}rep(i,N)rep(j,N){string S=to_string(A[i][j]);while(S.size()<3)S='0'+S;cout<<S<<(j==N-1?"\n":" ");}}