結果

問題 No.232 めぐるはめぐる (2)
ユーザー fumiphysfumiphys
提出日時 2019-10-08 02:25:53
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 131 ms / 1,000 ms
コード長 3,992 bytes
コンパイル時間 1,615 ms
コンパイル使用メモリ 168,292 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-14 12:46:40
合計ジャッジ時間 3,419 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 130 ms
5,248 KB
testcase_01 AC 131 ms
5,376 KB
testcase_02 AC 128 ms
5,376 KB
testcase_03 AC 128 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 93 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 3 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 2 ms
5,376 KB
testcase_24 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <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;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

// 012
// 3 4
// 567

int c[100010];

int main(int argc, char const* argv[])
{
  int t, a, b; cin >> t >> a >> b;
  swap(a, b);
  if(a == 0 && b == 0 && t == 1){
    cout << "NO" << endl;
    return 0;
  }
  if(t < max(a, b)){
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  int i = 0;
  for(; i < min(a, b); i++){
    c[i] = 2;
  }
  for(; i < max(a, b); i++){
    if(a > b)c[i] = 4;
    else c[i] = 1;
  }

  if((t - i) % 2 == 0){
    for(; i < t; i += 2){
      c[i] = 4;
      c[i+1] = 3;
    }
  }else{
    if(t == i + 1){
      if(c[i-1] == 4){
        c[i-1] = 6;
        c[i] = 2;
      }else if(c[i-1] == 1){
        c[i-1] = 4;
        c[i] = 0;
      }else{
        c[i-1] = 4;
        c[i] = 1;
      }
    }else{
      while(i + 3 < t){
        c[i] = 4;
        c[i+1] = 3;
        i += 2;
      }
      c[i] = 1;
      c[i+1] = 4;
      c[i+2] = 5;
    }
  }

  rep(j, t){
    if(c[j] <= 2)cout << "^";
    if(c[j] == 0 || c[j] == 3 || c[j] == 5)cout << "<";
    if(c[j] == 2 || c[j] == 4 || c[j] == 7)cout << ">";
    if(c[j] >= 5)cout << "v";
    cout << endl;
  }
  return 0;
}
0