結果
問題 | No.1362 [Zelkova 8th Tune] Black Sheep |
ユーザー |
![]() |
提出日時 | 2021-01-22 21:27:43 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 1,000 ms |
コード長 | 2,837 bytes |
コンパイル時間 | 2,240 ms |
コンパイル使用メモリ | 200,328 KB |
最終ジャッジ日時 | 2025-01-18 03:40:47 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 38 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:103:15: warning: ‘a’ may be used uninitialized [-Wmaybe-uninitialized] 103 | rep(i, n) if(s[i] == a) { | ^~ main.cpp:100:10: note: ‘a’ was declared here 100 | char a; | ^
ソースコード
// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#define rep(i, n) for (int i = 0; i < (int)n; ++i)#define rrep(i, n) for (int i = (int)n - 1; i >= 0; --i)#define ALL(v) v.begin(), v.end()#define pb push_back#define eb emplace_back#define fi first#define se secondusing namespace std;using ll = long long;using ld = long double;const array<string, 2> YESNO = {"NO", "YES"};const array<string, 2> YesNo = {"No", "Yes"};const array<string, 2> yesno = {"no", "yes"};void YES(bool b = true) { cout << YESNO[b] << '\n'; }void Yes(bool b = true) { cout << YesNo[b] << '\n'; }void yes(bool b = true) { cout << yesno[b] << '\n'; }template<typename T, typename U>inline bool chmax(T& a, const U& b) {if (a < b){a = b;return true;}return false;}template<typename T, typename U>inline bool chmin(T& a, const U& b) {if (a > b) {a = b;return true;}return false;}template<typename T>void UNIQUE(vector<T>& v) {sort(v.begin(), v.end());v.erase(unique(v.begin(), v.end()));}template<typename T>int lb(const vector<T> v, T x) {return distance(v.begin(), lower_bound(v.begin(), v.end(), x));}template<typename T>int ub(const vector<T> v, T x) {return distance(v.begin(), upper_bound(v.begin(), v.end(), x));}/*** @brief 多次元 vector の作成* @author えびちゃん*/namespace detail {template<typename T, int N>auto make_vec(vector<int>& sizes, T const& x) {if constexpr (N == 1) {return vector(sizes[0], x);} else {int size = sizes[N-1];sizes.pop_back();return vector(size, make_vec<T, N-1>(sizes, x));}}}template<typename T, int N>auto make_vec(int const(&sizes)[N], T const& x = T()) {vector<int> s(N);for (int i = 0; i < N; ++i) s[i] = sizes[N-i-1];return detail::make_vec<T, N>(s, x);}template<typename T>ostream& operator<<(ostream& os, const vector<T>& v) {for (auto it = v.begin(); it != v.end(); ++it) {if (it == v.begin()) os << *it;else os << ' ' << *it;}return os;}template<typename T, typename U>ostream& operator<<(ostream& os, const pair<T, U>& p) {os << p.first << ' ' << p.second;return os;}__attribute__((constructor))void fast_io() {ios::sync_with_stdio(false);cin.tie(nullptr);}// #include <atcoder/all>// using namespace atcoder;// using mint = modint1000000007;// using mint = modint998244353;int main() {string s;cin >> s;map<char, int> mp;for (auto c : s) mp[c]++;char a;for (auto [c, x] : mp) if (x == 1) a = c;int n = s.size();rep(i, n) if(s[i] == a) {cout << i+1 << ' ' << a << '\n';}}