#include <bits/stdc++.h>
#include <time.h>
//#include <random>
//#ifndef _LOCAL
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#endif
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 2 * 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;
//mt19937 rnd(0);
int n;
int to_int(string t) {
int k = 0;
for (int i = 0; i < sz(t); i++)
(k *= 10) += (t[i] - '0');
return k;
}
//string to_str(int k) {
// string rs = "";
// while (k > 0) {
// rs = "" + char(k - '0') + rs;
// k /= 10;
// }
// while (sz(rs) < 4) rs = "0" + rs;
// return rs;
//}
bool gd(int d, int m, int y) {
int months[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
m--;
return (d > 0) && (m < 12) && (d <= months[m] + (m == 1 && ((y % 4) == 0)));
}
void solve() {
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
s.erase(sz(s) - 1, 1);
string ss = "";
ss = s.substr(0, 2);
int fd = to_int(ss);
ss = s.substr(3, 2);
int fm = to_int(ss);
ss = s.substr(6, 4);
int fy = to_int(ss);
reverse(s.begin(), s.end());
ss = s.substr(0, 2);
int d = to_int(ss);
ss = s.substr(2, 2);
int m = to_int(ss);
int y = fy;
if (y >= fy && (m > fm || (m == fm && d > fd)) && (gd(d, m, y))) {
if (d < 10) cout << 0;
cout << d << '.';
if (m < 10) cout << 0;
cout << m << '.';
if (y < 10) cout << "000"; else
if (y < 100) cout << "00"; else
if (y < 1000) cout << "0";
cout << y << '.' << el;
continue;
}
while (1) {
fy++;
string t = to_string(fy);
while (sz(t) < 4)
t = "0" + t;
reverse(t.begin(), t.end());
ss = t.substr(0, 2);
int d = to_int(ss);
ss = t.substr(2, 2);
int m = to_int(ss);
if (gd(d, m, fy)) {
if (d < 10) cout << 0;
cout << d << '.';
if (m < 10) cout << 0;
cout << m << '.';
if (fy < 10) cout << "000"; else
if (fy < 100) cout << "00"; else
if (fy < 1000) cout << "0";
cout << fy << '.' << el;
break;
}
}
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef _LOCAL
in("input.txt");
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
cout << "Test #" << i << elf;
clock_t start_time = clock();
solve();
cerr.precision(4); cerr << fixed;
cerr << elf;
cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;
cout << elf;
}
#else
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << el;
}
#endif
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Incorrect |
730 ms |
540 KB |
Output isn't correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
4 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Incorrect |
747 ms |
632 KB |
Output isn't correct |