답안 #54416 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
54416	2018-07-03T11:30:26 Z	egorlifar	Segments (IZhO18_segments)	C++17	75 / 100	3108 ms	41772 KB

segments

/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <iomanip>
#include <deque>
    
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define x first
#define y second
const string FILENAME = "input";
const int MAXN = 200228;
const int MAGIC = 1500;

//12:00
//17:00
int n, t;
int id = 0;
bool alive[MAXN];
int L[MAXN], R[MAXN];
int ids[MAXN];
int li[MAXN], ri[MAXN];
int lsz[MAXN], rsz[MAXN];
int cntin;


bool comp(const int &a, const int &b) {
    return R[a] - L[a] + 1 < R[b] - L[b] + 1;
}


int cntsmall(int l, int r, int k) {
    while (l != r){
        int mid = (l + r) >> 1;
        if (rsz[mid] - lsz[mid] + 1 >= k) {
            r = mid;
        } else {
            l = mid + 1;
        }
    }
    if (rsz[l] - lsz[l] + 1 < k) {
        return l + 1;
    }
    return l;
}
 

int getl(int pos, int k) {
    int res = 0;
    int border = (pos / MAGIC + 1) * MAGIC;
    for (int i = pos; i < min(border, cntin); i++) {
        if (rsz[i] < k) {
            res--;
        }
    }
    for (int i = border; i < cntin; i += MAGIC){
        int lb = i, rb = min(i + MAGIC, cntin);
        int val = lower_bound(ri + lb, ri + rb, k) - ri - lb;
        res -= val;
    }
    return res;
}

 
int getr(int pos, int k) {
    int res = 0;
    int border = (pos / MAGIC + 1) * MAGIC;
    for (int i = pos; i < min(border, cntin); i++) {
        if (lsz[i] > k) {
            res--;
        }
    }
    for (int i = border; i < cntin; i += MAGIC) {
        int lb  = i, rb = min(i + MAGIC, cntin);
        int val = rb - (upper_bound(li + lb, li + rb, k) - li);
        res -= val;
    }
    return res;
}


int st[MAXN];
bool st1[MAXN];
int uks;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
    cin >> n >> t;
    int cnt = 0;
    int pans = 0;
    for (int it = 0; it < n; it++) {
        if (uks >= MAGIC) {
            cntin = 0;
            uks = 0;
            for (int i = 1; i < MAXN; i++) {
                if (alive[i]) {
                    ids[cntin] = i;
                    cntin++;
                }
            }
            sort(ids, ids + cntin, comp);
            for (int i = 0; i < cntin; i++) {
                li[i] = lsz[i] = L[ids[i]];
            }
            for (int i = 0; i < cntin; i++) {
                ri[i] = rsz[i] = R[ids[i]];
            }
            for (int i = 0; i < cntin; i += MAGIC){
                int lb = i, rb = min(i + MAGIC, cntin);
                sort(li + lb, li + rb);
                sort(ri + lb, ri + rb);
            }
        }
        int type;
        cin >> type;
        if (type == 1) {
            int l, r;
            cin >> l >> r;
            l ^= pans * t;
            r ^= pans * t;
            if (l > r) {
                swap(l, r);
            }
            id++;
            cnt++;
            alive[id] = true;
            L[id] = l;
            R[id] = r;
            st[uks] = id;
            st1[uks] = 1;
            uks++;
        } else if (type == 2) {
            int id1;
            cin >> id1;
            cnt--;
            alive[id1] = false;
            st[uks] = id1;
            st1[uks] = 0;
            uks++;
        } else if (type == 3) {
            int l, r, k;
            cin >> l >> r >> k;
            l ^= pans * t;
            r ^= pans * t;
            if (l > r) {
                swap(l, r);
            }
            if (r - l + 1 < k) {
                cout << 0 << '\n';
                pans = 0;
                continue;
            }
            int ans = cnt;
            if (cntin) {
                int pos = cntsmall(0, cntin - 1, k);
                ans -= pos;
                ans += getl(pos, l + k - 1);
                ans += getr(pos, r - k + 1);
            }
            for (int j = 0; j < uks; j++) {
                int tl = max(L[st[j]], l);
                int tr = min(R[st[j]], r);
                if (tr - tl + 1 < k) {
                    if (st1[j]) {
                        ans--;
                    } else {
                        ans++;
                    }
                }
            }
            cout << ans << '\n';
            pans = ans;
        }
    }
}

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	13 ms	484 KB	Output is correct
4	Correct	14 ms	692 KB	Output is correct
5	Correct	13 ms	756 KB	Output is correct
6	Correct	14 ms	820 KB	Output is correct
7	Correct	13 ms	820 KB	Output is correct
8	Correct	11 ms	884 KB	Output is correct
9	Correct	12 ms	884 KB	Output is correct
10	Correct	7 ms	884 KB	Output is correct
11	Correct	24 ms	884 KB	Output is correct
12	Correct	24 ms	884 KB	Output is correct
13	Correct	7 ms	884 KB	Output is correct
14	Correct	12 ms	884 KB	Output is correct
15	Correct	12 ms	884 KB	Output is correct
16	Correct	12 ms	884 KB	Output is correct
17	Correct	13 ms	884 KB	Output is correct
18	Correct	9 ms	884 KB	Output is correct
19	Correct	13 ms	884 KB	Output is correct
20	Correct	12 ms	884 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	660 ms	2512 KB	Output is correct
2	Correct	664 ms	2512 KB	Output is correct
3	Correct	659 ms	2512 KB	Output is correct
4	Correct	802 ms	2536 KB	Output is correct
5	Correct	929 ms	3420 KB	Output is correct
6	Correct	945 ms	3516 KB	Output is correct
7	Correct	687 ms	3516 KB	Output is correct
8	Correct	653 ms	3516 KB	Output is correct
9	Correct	726 ms	3516 KB	Output is correct
10	Correct	993 ms	3516 KB	Output is correct
11	Correct	574 ms	3516 KB	Output is correct
12	Correct	954 ms	3516 KB	Output is correct

Subtask #3
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	238 ms	3516 KB	Output is correct
2	Correct	231 ms	3516 KB	Output is correct
3	Correct	255 ms	3516 KB	Output is correct
4	Correct	234 ms	3516 KB	Output is correct
5	Correct	965 ms	3516 KB	Output is correct
6	Correct	846 ms	3516 KB	Output is correct
7	Correct	965 ms	3516 KB	Output is correct
8	Correct	990 ms	3592 KB	Output is correct
9	Correct	1006 ms	3592 KB	Output is correct
10	Correct	923 ms	3592 KB	Output is correct
11	Correct	356 ms	3592 KB	Output is correct
12	Correct	931 ms	3592 KB	Output is correct
13	Correct	798 ms	3592 KB	Output is correct
14	Correct	586 ms	3592 KB	Output is correct
15	Correct	521 ms	3592 KB	Output is correct
16	Correct	510 ms	3592 KB	Output is correct
17	Correct	828 ms	3592 KB	Output is correct
18	Correct	909 ms	3592 KB	Output is correct
19	Correct	877 ms	3592 KB	Output is correct
20	Correct	880 ms	3592 KB	Output is correct
21	Correct	407 ms	3592 KB	Output is correct
22	Correct	688 ms	3592 KB	Output is correct
23	Correct	833 ms	3592 KB	Output is correct
24	Correct	724 ms	3592 KB	Output is correct
25	Correct	241 ms	3592 KB	Output is correct
26	Correct	276 ms	3592 KB	Output is correct
27	Correct	256 ms	3592 KB	Output is correct
28	Correct	240 ms	3592 KB	Output is correct
29	Correct	877 ms	3592 KB	Output is correct
30	Correct	848 ms	3592 KB	Output is correct
31	Correct	981 ms	3592 KB	Output is correct
32	Correct	917 ms	3592 KB	Output is correct
33	Correct	802 ms	3592 KB	Output is correct
34	Correct	521 ms	3592 KB	Output is correct
35	Correct	773 ms	3592 KB	Output is correct
36	Correct	835 ms	3592 KB	Output is correct

Subtask #4
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	221 ms	3592 KB	Output is correct
2	Correct	241 ms	3592 KB	Output is correct
3	Correct	231 ms	3592 KB	Output is correct
4	Correct	236 ms	3592 KB	Output is correct
5	Correct	831 ms	3592 KB	Output is correct
6	Correct	415 ms	3592 KB	Output is correct
7	Correct	959 ms	3592 KB	Output is correct
8	Correct	875 ms	3592 KB	Output is correct
9	Correct	642 ms	3592 KB	Output is correct
10	Correct	915 ms	3592 KB	Output is correct
11	Correct	441 ms	3592 KB	Output is correct
12	Correct	963 ms	3592 KB	Output is correct
13	Correct	902 ms	3592 KB	Output is correct
14	Correct	598 ms	3592 KB	Output is correct
15	Correct	958 ms	3592 KB	Output is correct
16	Correct	871 ms	3592 KB	Output is correct
17	Correct	666 ms	3592 KB	Output is correct
18	Correct	648 ms	3592 KB	Output is correct
19	Correct	730 ms	3592 KB	Output is correct
20	Correct	651 ms	3592 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	13 ms	484 KB	Output is correct
4	Correct	14 ms	692 KB	Output is correct
5	Correct	13 ms	756 KB	Output is correct
6	Correct	14 ms	820 KB	Output is correct
7	Correct	13 ms	820 KB	Output is correct
8	Correct	11 ms	884 KB	Output is correct
9	Correct	12 ms	884 KB	Output is correct
10	Correct	7 ms	884 KB	Output is correct
11	Correct	24 ms	884 KB	Output is correct
12	Correct	24 ms	884 KB	Output is correct
13	Correct	7 ms	884 KB	Output is correct
14	Correct	12 ms	884 KB	Output is correct
15	Correct	12 ms	884 KB	Output is correct
16	Correct	12 ms	884 KB	Output is correct
17	Correct	13 ms	884 KB	Output is correct
18	Correct	9 ms	884 KB	Output is correct
19	Correct	13 ms	884 KB	Output is correct
20	Correct	12 ms	884 KB	Output is correct
21	Correct	660 ms	2512 KB	Output is correct
22	Correct	664 ms	2512 KB	Output is correct
23	Correct	659 ms	2512 KB	Output is correct
24	Correct	802 ms	2536 KB	Output is correct
25	Correct	929 ms	3420 KB	Output is correct
26	Correct	945 ms	3516 KB	Output is correct
27	Correct	687 ms	3516 KB	Output is correct
28	Correct	653 ms	3516 KB	Output is correct
29	Correct	726 ms	3516 KB	Output is correct
30	Correct	993 ms	3516 KB	Output is correct
31	Correct	574 ms	3516 KB	Output is correct
32	Correct	954 ms	3516 KB	Output is correct
33	Correct	221 ms	3592 KB	Output is correct
34	Correct	241 ms	3592 KB	Output is correct
35	Correct	231 ms	3592 KB	Output is correct
36	Correct	236 ms	3592 KB	Output is correct
37	Correct	831 ms	3592 KB	Output is correct
38	Correct	415 ms	3592 KB	Output is correct
39	Correct	959 ms	3592 KB	Output is correct
40	Correct	875 ms	3592 KB	Output is correct
41	Correct	642 ms	3592 KB	Output is correct
42	Correct	915 ms	3592 KB	Output is correct
43	Correct	441 ms	3592 KB	Output is correct
44	Correct	963 ms	3592 KB	Output is correct
45	Correct	902 ms	3592 KB	Output is correct
46	Correct	598 ms	3592 KB	Output is correct
47	Correct	958 ms	3592 KB	Output is correct
48	Correct	871 ms	3592 KB	Output is correct
49	Correct	666 ms	3592 KB	Output is correct
50	Correct	648 ms	3592 KB	Output is correct
51	Correct	730 ms	3592 KB	Output is correct
52	Correct	651 ms	3592 KB	Output is correct
53	Correct	250 ms	3592 KB	Output is correct
54	Correct	230 ms	3592 KB	Output is correct
55	Correct	230 ms	3592 KB	Output is correct
56	Correct	227 ms	3592 KB	Output is correct
57	Correct	541 ms	3592 KB	Output is correct
58	Correct	271 ms	3592 KB	Output is correct
59	Correct	1006 ms	3592 KB	Output is correct
60	Correct	1213 ms	3592 KB	Output is correct
61	Correct	887 ms	3592 KB	Output is correct
62	Correct	1073 ms	3592 KB	Output is correct
63	Correct	964 ms	3644 KB	Output is correct
64	Correct	1000 ms	3644 KB	Output is correct
65	Correct	475 ms	3644 KB	Output is correct
66	Correct	480 ms	3644 KB	Output is correct
67	Correct	838 ms	3644 KB	Output is correct
68	Correct	787 ms	3644 KB	Output is correct
69	Correct	669 ms	3644 KB	Output is correct
70	Correct	704 ms	3644 KB	Output is correct
71	Correct	677 ms	3644 KB	Output is correct
72	Correct	652 ms	3644 KB	Output is correct
73	Correct	535 ms	3644 KB	Output is correct
74	Correct	768 ms	3644 KB	Output is correct
75	Correct	988 ms	3644 KB	Output is correct
76	Correct	1020 ms	3644 KB	Output is correct
77	Correct	232 ms	3644 KB	Output is correct
78	Correct	236 ms	3644 KB	Output is correct
79	Correct	240 ms	3644 KB	Output is correct
80	Correct	234 ms	3644 KB	Output is correct
81	Correct	732 ms	4028 KB	Output is correct
82	Correct	525 ms	4028 KB	Output is correct
83	Correct	408 ms	4028 KB	Output is correct
84	Correct	718 ms	4192 KB	Output is correct
85	Correct	847 ms	4624 KB	Output is correct
86	Correct	857 ms	4628 KB	Output is correct
87	Correct	639 ms	4628 KB	Output is correct
88	Correct	427 ms	4628 KB	Output is correct

Subtask #6
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	13 ms	484 KB	Output is correct
4	Correct	14 ms	692 KB	Output is correct
5	Correct	13 ms	756 KB	Output is correct
6	Correct	14 ms	820 KB	Output is correct
7	Correct	13 ms	820 KB	Output is correct
8	Correct	11 ms	884 KB	Output is correct
9	Correct	12 ms	884 KB	Output is correct
10	Correct	7 ms	884 KB	Output is correct
11	Correct	24 ms	884 KB	Output is correct
12	Correct	24 ms	884 KB	Output is correct
13	Correct	7 ms	884 KB	Output is correct
14	Correct	12 ms	884 KB	Output is correct
15	Correct	12 ms	884 KB	Output is correct
16	Correct	12 ms	884 KB	Output is correct
17	Correct	13 ms	884 KB	Output is correct
18	Correct	9 ms	884 KB	Output is correct
19	Correct	13 ms	884 KB	Output is correct
20	Correct	12 ms	884 KB	Output is correct
21	Correct	660 ms	2512 KB	Output is correct
22	Correct	664 ms	2512 KB	Output is correct
23	Correct	659 ms	2512 KB	Output is correct
24	Correct	802 ms	2536 KB	Output is correct
25	Correct	929 ms	3420 KB	Output is correct
26	Correct	945 ms	3516 KB	Output is correct
27	Correct	687 ms	3516 KB	Output is correct
28	Correct	653 ms	3516 KB	Output is correct
29	Correct	726 ms	3516 KB	Output is correct
30	Correct	993 ms	3516 KB	Output is correct
31	Correct	574 ms	3516 KB	Output is correct
32	Correct	954 ms	3516 KB	Output is correct
33	Correct	238 ms	3516 KB	Output is correct
34	Correct	231 ms	3516 KB	Output is correct
35	Correct	255 ms	3516 KB	Output is correct
36	Correct	234 ms	3516 KB	Output is correct
37	Correct	965 ms	3516 KB	Output is correct
38	Correct	846 ms	3516 KB	Output is correct
39	Correct	965 ms	3516 KB	Output is correct
40	Correct	990 ms	3592 KB	Output is correct
41	Correct	1006 ms	3592 KB	Output is correct
42	Correct	923 ms	3592 KB	Output is correct
43	Correct	356 ms	3592 KB	Output is correct
44	Correct	931 ms	3592 KB	Output is correct
45	Correct	798 ms	3592 KB	Output is correct
46	Correct	586 ms	3592 KB	Output is correct
47	Correct	521 ms	3592 KB	Output is correct
48	Correct	510 ms	3592 KB	Output is correct
49	Correct	828 ms	3592 KB	Output is correct
50	Correct	909 ms	3592 KB	Output is correct
51	Correct	877 ms	3592 KB	Output is correct
52	Correct	880 ms	3592 KB	Output is correct
53	Correct	407 ms	3592 KB	Output is correct
54	Correct	688 ms	3592 KB	Output is correct
55	Correct	833 ms	3592 KB	Output is correct
56	Correct	724 ms	3592 KB	Output is correct
57	Correct	241 ms	3592 KB	Output is correct
58	Correct	276 ms	3592 KB	Output is correct
59	Correct	256 ms	3592 KB	Output is correct
60	Correct	240 ms	3592 KB	Output is correct
61	Correct	877 ms	3592 KB	Output is correct
62	Correct	848 ms	3592 KB	Output is correct
63	Correct	981 ms	3592 KB	Output is correct
64	Correct	917 ms	3592 KB	Output is correct
65	Correct	802 ms	3592 KB	Output is correct
66	Correct	521 ms	3592 KB	Output is correct
67	Correct	773 ms	3592 KB	Output is correct
68	Correct	835 ms	3592 KB	Output is correct
69	Correct	221 ms	3592 KB	Output is correct
70	Correct	241 ms	3592 KB	Output is correct
71	Correct	231 ms	3592 KB	Output is correct
72	Correct	236 ms	3592 KB	Output is correct
73	Correct	831 ms	3592 KB	Output is correct
74	Correct	415 ms	3592 KB	Output is correct
75	Correct	959 ms	3592 KB	Output is correct
76	Correct	875 ms	3592 KB	Output is correct
77	Correct	642 ms	3592 KB	Output is correct
78	Correct	915 ms	3592 KB	Output is correct
79	Correct	441 ms	3592 KB	Output is correct
80	Correct	963 ms	3592 KB	Output is correct
81	Correct	902 ms	3592 KB	Output is correct
82	Correct	598 ms	3592 KB	Output is correct
83	Correct	958 ms	3592 KB	Output is correct
84	Correct	871 ms	3592 KB	Output is correct
85	Correct	666 ms	3592 KB	Output is correct
86	Correct	648 ms	3592 KB	Output is correct
87	Correct	730 ms	3592 KB	Output is correct
88	Correct	651 ms	3592 KB	Output is correct
89	Correct	250 ms	3592 KB	Output is correct
90	Correct	230 ms	3592 KB	Output is correct
91	Correct	230 ms	3592 KB	Output is correct
92	Correct	227 ms	3592 KB	Output is correct
93	Correct	541 ms	3592 KB	Output is correct
94	Correct	271 ms	3592 KB	Output is correct
95	Correct	1006 ms	3592 KB	Output is correct
96	Correct	1213 ms	3592 KB	Output is correct
97	Correct	887 ms	3592 KB	Output is correct
98	Correct	1073 ms	3592 KB	Output is correct
99	Correct	964 ms	3644 KB	Output is correct
100	Correct	1000 ms	3644 KB	Output is correct
101	Correct	475 ms	3644 KB	Output is correct
102	Correct	480 ms	3644 KB	Output is correct
103	Correct	838 ms	3644 KB	Output is correct
104	Correct	787 ms	3644 KB	Output is correct
105	Correct	669 ms	3644 KB	Output is correct
106	Correct	704 ms	3644 KB	Output is correct
107	Correct	677 ms	3644 KB	Output is correct
108	Correct	652 ms	3644 KB	Output is correct
109	Correct	535 ms	3644 KB	Output is correct
110	Correct	768 ms	3644 KB	Output is correct
111	Correct	988 ms	3644 KB	Output is correct
112	Correct	1020 ms	3644 KB	Output is correct
113	Correct	232 ms	3644 KB	Output is correct
114	Correct	236 ms	3644 KB	Output is correct
115	Correct	240 ms	3644 KB	Output is correct
116	Correct	234 ms	3644 KB	Output is correct
117	Correct	732 ms	4028 KB	Output is correct
118	Correct	525 ms	4028 KB	Output is correct
119	Correct	408 ms	4028 KB	Output is correct
120	Correct	718 ms	4192 KB	Output is correct
121	Correct	847 ms	4624 KB	Output is correct
122	Correct	857 ms	4628 KB	Output is correct
123	Correct	639 ms	4628 KB	Output is correct
124	Correct	427 ms	4628 KB	Output is correct
125	Correct	456 ms	4628 KB	Output is correct
126	Correct	480 ms	4628 KB	Output is correct
127	Correct	503 ms	4628 KB	Output is correct
128	Correct	475 ms	4628 KB	Output is correct
129	Correct	465 ms	4628 KB	Output is correct
130	Correct	485 ms	7596 KB	Output is correct
131	Correct	1108 ms	14344 KB	Output is correct
132	Correct	2298 ms	21448 KB	Output is correct
133	Correct	3108 ms	27552 KB	Output is correct
134	Correct	2216 ms	31268 KB	Output is correct
135	Correct	2952 ms	38712 KB	Output is correct
136	Runtime error	1073 ms	41772 KB	Memory limit exceeded
137	Halted	0 ms	0 KB	-

답안 #54416

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 15.0 / 15.0

Subtask #3 16.0 / 16.0

Subtask #4 17.0 / 17.0

Subtask #5 20.0 / 20.0

Subtask #6 0 / 25.0

Subtask #1
7.0 / 7.0

Subtask #2
15.0 / 15.0

Subtask #3
16.0 / 16.0

Subtask #4
17.0 / 17.0

Subtask #5
20.0 / 20.0

Subtask #6
0 / 25.0