結果
問題 | No.401 数字の渦巻き |
ユーザー |
![]() |
提出日時 | 2018-12-01 17:48:06 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,080 bytes |
コンパイル時間 | 1,674 ms |
コンパイル使用メモリ | 175,176 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-27 00:01:38 |
合計ジャッジ時間 | 2,875 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
#include "bits/stdc++.h"using namespace std;typedef long long ll;typedef pair<int, int> pii;typedef pair<ll, ll> pll;const int INF = 1e9;const ll LINF = 1e18;inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out<< Mat[i];} return out; }template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out <<it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }/*<url:https://yukicoder.me/problems/no/401>問題文=============================================================================================================================解説=============================================================================================================================*/vector<vector<string>> solve(){int N; cin >> N;vector<vector<string>> res(N,vector<string>(N,"@"));int dx[4] = {1,0,-1,0};int dy[4] = {0,1,0,-1};int dir = 0;int cnt = 1;int x = 0,y = 0;while(cnt<=N*N){ostringstream ss; ss << std::setw(3) << setfill('0') << cnt;res[y][x] = ss.str();int ny = y + dy[dir];int nx = x + dx[dir];if(ny < 0 || nx < 0 || ny >= N || nx >= N || res[ny][nx] != "@"){(dir += 1)%=4;}y = y + dy[dir];x = x + dx[dir];cnt++;}return res;}int main(void) {cin.tie(0); ios_base::sync_with_stdio(false);cout << solve() << endl;return 0;}