# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
919502 | 2024-02-01T03:22:38 Z | TIN | Esej (COCI15_esej) | C++17 | 1000 ms | 19064 KB |
#pragma GCC optimize("Ofast", "unroll-loops") #include <bits/stdc++.h> using namespace std; #define FNAME "test" int A, B; int mndiff = 0; vector<string> dict; string res = ""; void Task() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << fixed << setprecision(9); if (fopen(FNAME".inp","r")) { freopen(FNAME".inp","r",stdin); freopen(FNAME".out","w",stdout); } } void Solve() { //Your Code cin >> A >> B; mndiff = B / 2; for (int i = 0; i < 26; i++) { for (int j = 0; j < 26; j++) { for (int k = 0; k < 26; k++) { for (int l = 0; l < 26; l++) { string s = ""; char c; c = 'a' + i; s += c; c = 'a' + j; s += c; c = 'a' + k; s += c; c = 'a' + l; s += c; dict.push_back(s); } } } } int cntwords = 0; for (; cntwords < B / 2; ++cntwords) res = res + dict[cntwords] + " "; while (cntwords < A) res = res + dict[0] + " ", ++cntwords; cout << res << '\n'; } int main() { Task(); Solve(); cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms"; return 37^37; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 17096 KB | Output is correct |
2 | Correct | 15 ms | 17352 KB | Output is correct |
3 | Correct | 16 ms | 17668 KB | Output is correct |
4 | Correct | 12 ms | 17096 KB | Output is correct |
5 | Correct | 16 ms | 17096 KB | Output is correct |
6 | Correct | 29 ms | 18120 KB | Output is correct |
7 | Correct | 310 ms | 17236 KB | Output is correct |
8 | Correct | 768 ms | 18444 KB | Output is correct |
9 | Execution timed out | 1032 ms | 19064 KB | Time limit exceeded |
10 | Correct | 307 ms | 18120 KB | Output is correct |