| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 219305 |
2020-04-05T06:28:14 Z |
kartel |
Datum (COCI20_datum) |
C++14 |
|
1000 ms |
504 KB |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +400500
//#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
string da, ma, ya;
void makeans(string d, string m, string y)
{
int D, M, Y, DA, MA, YA;
D = atoi(d.c_str());
M = atoi(m.c_str());
Y = atoi(y.c_str());
DA = atoi(da.c_str());
MA = atoi(ma.c_str());
YA = atoi(ya.c_str());
if (Y < YA) {ya = y; ma = m; da = d;return;}
if (Y == YA && M < MA) {ya = y; ma = m; da = d;return;}
if (Y == YA && M == MA && D < DA) {ya = y; ma = M; da = d;return;}
}
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("qual.in");
// out("qual.out");
int q;
cin >> q;
while (q--)
{
string s, t, m, y, d;
int i, j, Y, D;
cin >> s;
ya = "9999";
ma = "99";
da = "99";
t = s;
t.erase(t.size() - 1);
t.erase(2, 1);
t.erase(4, 1);
j = 0;
while (j < t.size() - j - 1) t[j] = t[t.size() - j - 1], j++;
m = t.substr(2, 2);
d = t.substr(0, 2);
y = t.substr(4);
Y = atoi(y.c_str());
D = atoi(d.c_str());
if (m == "01" && D <= 31) makeans(d, m, y);
if ((m == "02" && D <= 28) || (Y % 4 == 0 && m == "02" && D <= 29)) makeans(d, m, y);
if (m == "03" && D <= 31) makeans(d, m, y);
if (m == "04" && D <= 30) makeans(d, m, y);
if (m == "05" && D <= 31) makeans(d, m, y);
if (m == "06" && D <= 30) makeans(d, m, y);
if (m == "07" && D <= 31) makeans(d, m, y);
if (m == "08" && D <= 31) makeans(d, m, y);
if (m == "09" && D <= 30) makeans(d, m, y);
if (m == "10" && D <= 31) makeans(d, m, y);
if (m == "11" && D <= 30) makeans(d, m, y);
if (m == "12" && D <= 31) makeans(d, m, y);
for (i = 0; i < 4000; i++)
{
j = t.size() - 1;
while (j >= 0 && t[j] == '9') t[j] = '0', j--;
if (j < 0) break;
t[j]++;
j = 0;
while (j < t.size() - j - 1) t[j] = t[t.size() - j - 1], j++;
m = t.substr(2, 2);
d = t.substr(0, 2);
y = t.substr(4);
Y = atoi(y.c_str());
D = atoi(d.c_str());
if (m == "01" && D <= 31) makeans(d, m, y);
if ((m == "02" && D <= 28) || (Y % 4 == 0 && m == "02" && D <= 29)) makeans(d, m, y);
if (m == "03" && D <= 31) makeans(d, m, y);
if (m == "04" && D <= 30) makeans(d, m, y);
if (m == "05" && D <= 31) makeans(d, m, y);
if (m == "06" && D <= 30) makeans(d, m, y);
if (m == "07" && D <= 31) makeans(d, m, y);
if (m == "08" && D <= 31) makeans(d, m, y);
if (m == "09" && D <= 30) makeans(d, m, y);
if (m == "10" && D <= 31) makeans(d, m, y);
if (m == "11" && D <= 30) makeans(d, m, y);
if (m == "12" && D <= 31) makeans(d, m, y);
}
cout << da << "." << ma << "." << ya << "." << el;
}
}
Compilation message
datum.cpp: In function 'int main()':
datum.cpp:69:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (j < t.size() - j - 1) t[j] = t[t.size() - j - 1], j++;
~~^~~~~~~~~~~~~~~~~~
datum.cpp:99:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (j < t.size() - j - 1) t[j] = t[t.size() - j - 1], j++;
~~^~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
384 KB |
Output is correct |
| 2 |
Execution timed out |
1092 ms |
392 KB |
Time limit exceeded |
| 3 |
Correct |
14 ms |
384 KB |
Output is correct |
| 4 |
Correct |
14 ms |
384 KB |
Output is correct |
| 5 |
Correct |
14 ms |
384 KB |
Output is correct |
| 6 |
Incorrect |
16 ms |
384 KB |
Output isn't correct |
| 7 |
Incorrect |
14 ms |
384 KB |
Output isn't correct |
| 8 |
Incorrect |
13 ms |
384 KB |
Output isn't correct |
| 9 |
Incorrect |
14 ms |
384 KB |
Output isn't correct |
| 10 |
Execution timed out |
1098 ms |
504 KB |
Time limit exceeded |
