# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
833978 | 2023-08-22T09:55:27 Z | helloworld1705 | Bad Codes (CCO19_day2problem3) | C++14 | 5 ms | 1876 KB |
/* _ _ | | (_) | |__ __ _ ___ _ ___ | '_ \ / _` / __| |/ __| | |_) | (_| \__ \ | (__ |_.__/ \__,_|___/_|\___| */ #include<bits/stdc++.h> #define int long long using namespace std; const int N = 1e6 + 5; #define pii pair <int , int> #define fi first #define se second #define bit(a,b) ((a >> b) & 1ll) const int M = 1e3 + 3; const int inf = 1e18; const int mod = 1e9 + 7; int TEST = 0; void STEST(); /* -----------------[ MAIN CODE GOES HERE ]----------------- */ void init() { } string s[10001]; set <string> st; void solve() { int n , m; cin >> n >> m; for(int i = 0; i < n; i++) { cin >> s[i]; } int res = inf; for(int sz = 1; sz < 7; sz++) { for(int i = 0; i < (1 << (sz * 2)); i++) { string ans = ""; int x = i; for(int j = 0; j < sz; j++) { ans += s[x & 3]; x = (x >> 2); } if(st.find(ans) == st.end()) { st.insert(ans); continue; } int SIZE = ans.size(); res = min(res , SIZE); } } cout << (res == inf ? -1 : res) << '\n'; return; } main() { if (fopen("code.inp", "r")) { freopen("code.inp", "r", stdin); freopen("code.out", "w", stdout); } ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); STEST(); if(TEST) { int t; cin >> t; while(t-->0) { // your code down here // solve(); } } else { solve(); } return 0x0; } void STEST() { } // code by nothing //
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 972 KB | Output is correct |
2 | Correct | 3 ms | 1236 KB | Output is correct |
3 | Correct | 4 ms | 1108 KB | Output is correct |
4 | Correct | 3 ms | 1108 KB | Output is correct |
5 | Correct | 2 ms | 980 KB | Output is correct |
6 | Correct | 3 ms | 1108 KB | Output is correct |
7 | Correct | 2 ms | 852 KB | Output is correct |
8 | Correct | 3 ms | 1236 KB | Output is correct |
9 | Correct | 3 ms | 1108 KB | Output is correct |
10 | Correct | 3 ms | 1108 KB | Output is correct |
11 | Correct | 3 ms | 1108 KB | Output is correct |
12 | Correct | 3 ms | 1108 KB | Output is correct |
13 | Correct | 3 ms | 1236 KB | Output is correct |
14 | Correct | 3 ms | 1236 KB | Output is correct |
15 | Correct | 4 ms | 1108 KB | Output is correct |
16 | Correct | 3 ms | 1236 KB | Output is correct |
17 | Correct | 3 ms | 1236 KB | Output is correct |
18 | Correct | 3 ms | 1236 KB | Output is correct |
19 | Correct | 3 ms | 1236 KB | Output is correct |
20 | Correct | 3 ms | 1236 KB | Output is correct |
21 | Correct | 3 ms | 1236 KB | Output is correct |
22 | Correct | 3 ms | 1360 KB | Output is correct |
23 | Correct | 3 ms | 1108 KB | Output is correct |
24 | Correct | 3 ms | 1236 KB | Output is correct |
25 | Correct | 3 ms | 1236 KB | Output is correct |
26 | Correct | 3 ms | 1236 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 1876 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 972 KB | Output is correct |
2 | Correct | 3 ms | 1236 KB | Output is correct |
3 | Correct | 4 ms | 1108 KB | Output is correct |
4 | Correct | 3 ms | 1108 KB | Output is correct |
5 | Correct | 2 ms | 980 KB | Output is correct |
6 | Correct | 3 ms | 1108 KB | Output is correct |
7 | Correct | 2 ms | 852 KB | Output is correct |
8 | Correct | 3 ms | 1236 KB | Output is correct |
9 | Correct | 3 ms | 1108 KB | Output is correct |
10 | Correct | 3 ms | 1108 KB | Output is correct |
11 | Correct | 3 ms | 1108 KB | Output is correct |
12 | Correct | 3 ms | 1108 KB | Output is correct |
13 | Correct | 3 ms | 1236 KB | Output is correct |
14 | Correct | 3 ms | 1236 KB | Output is correct |
15 | Correct | 4 ms | 1108 KB | Output is correct |
16 | Correct | 3 ms | 1236 KB | Output is correct |
17 | Correct | 3 ms | 1236 KB | Output is correct |
18 | Correct | 3 ms | 1236 KB | Output is correct |
19 | Correct | 3 ms | 1236 KB | Output is correct |
20 | Correct | 3 ms | 1236 KB | Output is correct |
21 | Correct | 3 ms | 1236 KB | Output is correct |
22 | Correct | 3 ms | 1360 KB | Output is correct |
23 | Correct | 3 ms | 1108 KB | Output is correct |
24 | Correct | 3 ms | 1236 KB | Output is correct |
25 | Correct | 3 ms | 1236 KB | Output is correct |
26 | Correct | 3 ms | 1236 KB | Output is correct |
27 | Incorrect | 5 ms | 1876 KB | Output isn't correct |
28 | Halted | 0 ms | 0 KB | - |