結果

問題 No.1362 [Zelkova 8th Tune] Black Sheep
ユーザー ninoinuininoinui
提出日時 2021-12-29 10:34:58
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 5 ms / 1,000 ms
コード長 3,348 bytes
コンパイル時間 2,418 ms
コンパイル使用メモリ 198,912 KB
最終ジャッジ日時 2025-01-27 07:26:52
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 38
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:14:19: warning: ‘ans’ may be used uninitialized [-Wmaybe-uninitialized]
   14 |     cout << S.find(ans) + 1 << " " << ans << '\n';
      |             ~~~~~~^~~~~
main.cpp:11:10: note: ‘ans’ was declared here
   11 |     char ans;
      |          ^~~

ソースコード

diff #
プレゼンテーションモードにする

#ifndef _DEBUG
#define _DEBUG
#include __FILE__
int main() {
string S;
cin >> S;
map<char, long> MA;
for (const auto& a : S) MA[a]++;
char ans;
for (const auto& [a, b] : MA)
if (b == 1) ans = a;
cout << S.find(ans) + 1 << " " << ans << '\n';
}
#else
// #undef _DEBUG
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename T2>
bool cmin(T& a, const T2& b) {
return a > b ? a = b, true : false;
}
template <typename T, typename T2>
bool cmax(T& a, const T2& b) {
return a < b ? a = b, true : false;
}
__attribute__((constructor)) void ios_setup() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec);
template <typename T>
ostream& operator<<(ostream& os, const vector<vector<T> >& vec);
template <typename T>
ostream& operator<<(ostream& os, const vector<vector<vector<T> > >& vec);
template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename A, typename B, typename C>
ostream& operator<<(ostream& os, const tuple<A, B, C>& t) {
const auto& [a, b, c] = t;
return os << "(" << a << ", " << b << ", " << c << ")";
}
template <typename A, typename B, typename C, typename D>
ostream& operator<<(ostream& os, const tuple<A, B, C, D>& t) {
const auto& [a, b, c, d] = t;
return os << "(" << a << ", " << b << ", " << c << ", " << d << ")";
}
template <typename T>
ostream& operator<<(ostream& os, priority_queue<T> pq) {
os << "{";
while (!pq.empty()) os << pq.top() << (pq.size() > 1 ? " " : ""), pq.pop();
return os << "}";
}
#define FOREACH(it, a) for (auto it = (a).begin(); it != (a).end(); it++)
template <typename T>
ostream& operator<<(ostream& os, const set<T>& se) {
os << "{";
FOREACH (it, se) { os << (it == se.begin() ? "" : " ") << *it; }
return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& ms) {
os << "{";
FOREACH (it, ms) { os << (it == ms.begin() ? "" : " ") << *it; }
return os << "}";
}
template <typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& ma) {
os << "{";
FOREACH (it, ma) { os << (it == ma.begin() ? "" : " ") << *it; }
return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
os << "{";
FOREACH (it, vec) { os << (it == vec.begin() ? "" : " ") << *it; }
return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<vector<T> >& vec) {
os << "{\n";
FOREACH (it, vec) { os << (it == vec.begin() ? " " : "\n ") << *it; }
return os << "\n}";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<vector<vector<T> > >& vec) {
os << "{\n";
FOREACH (it, vec) {
os << (it == vec.begin() ? "" : "\n") << "(" << it - vec.begin() << ") " << *it;
}
return os << "\n}";
}
void dump() {}
template <typename Head, typename... Tail>
void dump(const Head& head, const Tail&... tail) {
cout << head << (sizeof...(tail) ? ", " : "\n"), dump(tail...);
}
#ifdef _DEBUG
#define DUMP(...) cout << "[" << (#__VA_ARGS__) << "] ", dump(__VA_ARGS__)
#else
#define DUMP(...) (void)0
#endif
#endif
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0