結果
問題 | No.548 国士無双 |
ユーザー | naimonon77 |
提出日時 | 2017-08-06 12:52:53 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,427 bytes |
コンパイル時間 | 1,571 ms |
コンパイル使用メモリ | 180,372 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-17 13:42:00 |
合計ジャッジ時間 | 2,239 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 1 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 2 ms
6,940 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,944 KB |
testcase_17 | AC | 2 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 1 ms
6,944 KB |
testcase_22 | AC | 1 ms
6,944 KB |
testcase_23 | AC | 2 ms
6,944 KB |
ソースコード
#define TEST_MODE true #define _CRT_SECURE_NO_WARNINGS #define _USE_MATH_DEFINES #include "bits/stdc++.h" using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i) #define rrep(i, n) for (int i = (n)-1; i >= 0; --i) #define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i) #define range(i, a, b, c) for (int i = a; \ c > 0 ? i < b : i > b; \ i += c) #define chmax(a, b) (a = (a) < (b) ? (b) : (a)) #define chmin(a, b) (a = (a) > (b) ? (b) : (a)) using ll = long long; using ull = unsigned long long; using ld = long double; #define all(a) begin(a), end(a) #define ifnot(a) if (not(a)) #define int long long #ifdef LOCAL_ENV #if TEST_MODE == true const bool test = true; #define dump(x) cerr << #x << " = " << (x) << endl #else const bool test = false; #define dump(x) #endif #else const bool test = false; #define dump(x) #endif int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; const int INF = (int)1 << 60; const ll INFL = (ll)1 << 60; ll mod_n = (int)1e9 + 7; const double eps = 1e-10; typedef long double Real; // return -1, 0, 1 int sgn(const Real &r) { return (r > eps) - (r < -eps); } int sgn(const Real &a, const Real &b) { return sgn(a - b); } //..................... const int MAX = (int)2e5 + 5; vector<string> split(const string &str, char sep) { vector<string> v; stringstream ss(str); string buffer; while (getline(ss, buffer, sep)) { v.push_back(buffer); } return v; } template <class InputIterator> int sum(InputIterator begin, InputIterator end) { return accumulate(begin, end, 0ll); } void solve(); class Solver { public: string S; void solve() { cin >> S; set<int> set1; rep(i, S.size()) set1.insert(S[i]); char not_exists_char = 0; vector<char> one_vec; // int double_exists_cnt = 0; rep2(c, 'a', 'm' + 1) { if (set1.count(c) == 0) { if (not_exists_char != 0) { cout << "Impossible" << endl; return; } not_exists_char = c; } if (set1.count(c) == 1) one_vec.push_back(c); } if (not_exists_char == 0) { rep(i, one_vec.size()) { cout << one_vec[i] << endl; } } else cout << not_exists_char << endl; } }; signed main() { cout << fixed << setprecision(20); auto ptr = new Solver(); ptr->solve(); delete ptr; // while (true) { // auto ptr = new Solver(); // ptr->solve(); // delete ptr; // } return 0; } // class Mycin { // bool flag = true; // public: // Mycin& operator >> (int& a) {flag = scanf("%lld", &a) != EOF; return *this;} // Mycin& operator >> (char& a) {flag = scanf("%c", &a) != EOF; return *this;} // Mycin& operator >> (string& s) {flag = (bool)(cin >> s); return *this;} // operator bool() {return flag;} // } mycin; // class Mycout { // public: // Mycout& operator << (const int& a) {printf("%lld", a); return *this;} // Mycout& operator << (const char c) {printf("%c", c); return *this;} // Mycout& operator << (const string& s) {printf("%s", s.c_str()); return *this;} // } mycout; // #define cin mycin // #define cout mycout // #define endl '\n'