답안 #219319

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
219319	2020-04-05T06:45:00 Z	kartel	Datum (COCI20_datum)	C++14	20 / 50	1000 ms	2168 KB

datum

#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;
int ds, ys, ms, Y, M, D;
vector <pair <string, pair <string, string> > > v;

bool gd(string d, string m, string y)
{
    ds = atoi(d.c_str());
    ms = atoi(m.c_str());
    ys = atoi(y.c_str());
    if (ys < Y) return 0;
    if (ys == Y && ms < M) return 0;
    if (ys == Y && ms == M && ds < D) return 0;
    return 1;
}

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, j;
    string s, t, m, y, d;
    cin >> q;

    t = "00000000";
    while (1)
    {
        j = t.size() - 1;
        while (j >= 0 && t[j] == '9') t[j] = '0', j--;
        if (j < 0) break;
        t[j]++;

        j = 0;
        while (j < 4) t[j] = t[t.size() - j - 1], j++;
        y = t.substr(4);
        m = t.substr(2, 2);
        d = t.substr(0, 2);
        v.pb({d, {m, y}});
    }

    while (q--)
    {
        cin >> s;

        t = s;
        t.erase(t.size() - 1);
        t.erase(2, 1);
        t.erase(4, 1);

        M = atoi(t.substr(2, 2).c_str());
        D = atoi(t.substr(0, 2).c_str());
        Y = atoi(t.substr(4).c_str());

        for (auto it : v)
            if (gd(it.F, it.S.F, it.S.S))
            {
                cout << it.F << "." << it.S.F << "." << it.S.S << "." << el;
                break;
            }
    }
}

Subtask #1

20.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	2040 KB	Output is correct
2	Execution timed out	1089 ms	1912 KB	Time limit exceeded
3	Correct	11 ms	2040 KB	Output is correct
4	Correct	12 ms	2168 KB	Output is correct
5	Correct	13 ms	2040 KB	Output is correct
6	Incorrect	14 ms	2040 KB	Output isn't correct
7	Incorrect	13 ms	2040 KB	Output isn't correct
8	Incorrect	15 ms	2040 KB	Output isn't correct
9	Incorrect	13 ms	2040 KB	Output isn't correct
10	Execution timed out	1092 ms	2040 KB	Time limit exceeded