結果
問題 | No.1994 Confusing Name |
ユーザー | Linaria2002 |
提出日時 | 2022-07-20 19:46:27 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,585 ms / 2,000 ms |
コード長 | 2,603 bytes |
コンパイル時間 | 1,979 ms |
コンパイル使用メモリ | 210,788 KB |
実行使用メモリ | 8,832 KB |
最終ジャッジ日時 | 2024-07-02 14:00:39 |
合計ジャッジ時間 | 22,196 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 6 ms
6,940 KB |
testcase_06 | AC | 14 ms
6,944 KB |
testcase_07 | AC | 3 ms
6,940 KB |
testcase_08 | AC | 11 ms
6,940 KB |
testcase_09 | AC | 15 ms
6,944 KB |
testcase_10 | AC | 8 ms
6,940 KB |
testcase_11 | AC | 6 ms
6,940 KB |
testcase_12 | AC | 1,334 ms
8,704 KB |
testcase_13 | AC | 1,585 ms
8,704 KB |
testcase_14 | AC | 1,430 ms
8,320 KB |
testcase_15 | AC | 1,134 ms
7,296 KB |
testcase_16 | AC | 941 ms
7,040 KB |
testcase_17 | AC | 1,073 ms
7,552 KB |
testcase_18 | AC | 1,550 ms
8,704 KB |
testcase_19 | AC | 1,467 ms
8,832 KB |
testcase_20 | AC | 1,499 ms
8,832 KB |
testcase_21 | AC | 237 ms
5,376 KB |
testcase_22 | AC | 106 ms
5,376 KB |
testcase_23 | AC | 1,309 ms
8,448 KB |
testcase_24 | AC | 1,291 ms
8,448 KB |
testcase_25 | AC | 748 ms
6,528 KB |
testcase_26 | AC | 331 ms
5,376 KB |
testcase_27 | AC | 1,199 ms
8,192 KB |
testcase_28 | AC | 828 ms
6,656 KB |
testcase_29 | AC | 82 ms
5,376 KB |
testcase_30 | AC | 943 ms
7,040 KB |
ソースコード
#include<bits/stdc++.h> #define int ll #define rep(i, N) for(int i = 0; i < (int)(N); ++i) #define rep1(i, N) for(int i = 1; i <= (int)(N); ++i) #define per(i, N) for(int i = (N)-1; i >= 0; --i) #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define bit(n, k) ((n) >> (k)) #define pcnt(n) (__builtin_popcount(n)) #define YesNo(ans) ans ? cout << "Yes\n" : cout << "No\n" #define endl '\n' #define fi first #define se second #define mkpr make_pair #define mktpl make_tuple #define eb emplace_back using namespace std; using ll = int64_t; using ull = uint64_t; using ld = long double; //using point = struct{ ll x, y; }; using point = struct{ ld x, y; }; using State = string::iterator; template<class T> using max_heap = priority_queue<T>; template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>; template<class T> using vec = vector<T>; template<class T> using vvec = vec<vec<T>>; template<class T> using vvvec = vec<vvec<T>>; template<class T> using vvvvec = vvec<vvec<T>>; constexpr ld EPS = 1e-10; ld Pi = acos(-1); constexpr int INF = 1001001001; constexpr ll LINF = 1001001001001001001ll; constexpr ll MOD = (0) ? 998244353 : 1e9+7; constexpr int NIL = -1; constexpr int pm[2] = {1, -1}; constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1}; constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1}; ll cel(ll a, ll b){ return (a + b - 1) / b;} ll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : abs(a);} ll Lcm(ll a, ll b){ return a / Gcd(a, b) * b;} template<class T> T powi(T x, ll exp){ return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : x / x; } ll modpow(ll x, ll exp, ll mod){ x %= mod; return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1; } template<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;} template<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;} using Pair = pair<ll, ll>; using Tpl = tuple<char, int, int>; void Main(){ int N; cin >> N; vec<string> s(N); set<string> st; rep(i, N){ cin >> s[i]; st.insert(s[i]); } rep(i, N){ string t = s[i]; int ans = 0; rep(j, s[i].size()){ rep(k, 26){ char ch = k + 'a'; if(ch == t[j]) continue; t[j] = ch; if(st.find(t) != st.end()) ans++; t[j] = s[i][j]; } } cout << ans << endl; } } signed main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); Main(); return 0; }