답안 #284620

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
284620	2020-08-27T18:15:07 Z	AaronNaidu	이상한 기계 (APIO19_strange_device)	C++14	100 / 100	983 ms	68520 KB

strange_device

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

ll n, a, b, l, r, per;
set<pair<ll, ll> > segments, newSegments;

ll gcd(ll x, ll y) {
    if (y == 0)
    {
        return x;
    }
    return gcd(y, x % y);
}

void addSegment(ll sta, ll fin) {
    auto startPos = segments.upper_bound({sta, per});
    if (startPos == segments.begin())
    {
        for (auto i = segments.begin(); i != segments.end(); )
        {
            if (i->first <= fin)
            {
                fin = max(fin, i->second);
                segments.erase(i++);
            }
            else
            {
                break;
            }
        }
        segments.insert({sta, fin});
        return;
    }
    startPos--;
    if (startPos->second >= sta)
    {
        sta = min(sta, startPos->first);
        fin = max(fin, startPos->second);
        segments.erase(startPos++);
    }
    else
    {
        startPos++;
    }
      
    for (auto i = startPos; i != segments.end(); )
    {
        if (i->first <= fin)
        {
            fin = max(fin, i->second);
            segments.erase(i++);
        }
        else
        {
            break;
        }
    }
    segments.insert({sta, fin});     
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> a >> b;
    per = gcd(a, b+1);
    ld A = a;
    ld B = b;
    ld t = A/(1000000000000000007) * B;
    if (t > per)
    {
        per = 1000000000000000007;
    }
    else
    {
        per = round(A/per * B);
    }
    cin >> l >> r;
    if (r-l+1 >= per)
    {
        cout << per << "\n";
        return 0;
    }
    l = l%per;
    r = r%per;
    if(l <= r) {
        segments.insert({l, r});
    }
    else
    {
        segments.insert({0, r});
        segments.insert({l, per-1});
    }
    for (int i = 1; i < n; i++)
    {
        cin >> l >> r;
        if (r-l+1 >= per)
        {
        cout << per << "\n";
        return 0;
        }
        l = l%per;
        r = r%per;
        if (l <= r)
        {
            addSegment(l, r);
        }
        else
        {
            addSegment(0, r);
            addSegment(l, per-1);
        }
    }
    ll runningTotal = 0;
    for (auto i : segments)
    {
        runningTotal += i.second - i.first + 1;
    }
    cout << runningTotal << "\n";
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	8 ms	1280 KB	Output is correct
3	Correct	7 ms	1280 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	7 ms	1280 KB	Output is correct
17	Correct	81 ms	10272 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct

Subtask #2
5.0 / 5.0

#	결과	메모리	Grader output
1	Correct	384 KB	Output is correct
2	Correct	384 KB	Output is correct
3	Correct	384 KB	Output is correct
4	Correct	384 KB	Output is correct
5	Correct	384 KB	Output is correct

Subtask #3
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	365 ms	760 KB	Output is correct

Subtask #4
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	889 ms	68316 KB	Output is correct
3	Correct	829 ms	68252 KB	Output is correct
4	Correct	898 ms	68520 KB	Output is correct

Subtask #5
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	889 ms	68316 KB	Output is correct
3	Correct	829 ms	68252 KB	Output is correct
4	Correct	898 ms	68520 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	827 ms	68304 KB	Output is correct
7	Correct	861 ms	68344 KB	Output is correct
8	Correct	816 ms	67704 KB	Output is correct
9	Correct	893 ms	67704 KB	Output is correct

Subtask #6
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	889 ms	68316 KB	Output is correct
3	Correct	829 ms	68252 KB	Output is correct
4	Correct	898 ms	68520 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	74 ms	10208 KB	Output is correct
7	Correct	77 ms	10312 KB	Output is correct
8	Correct	76 ms	10248 KB	Output is correct
9	Correct	82 ms	10232 KB	Output is correct
10	Correct	87 ms	10360 KB	Output is correct
11	Correct	81 ms	10232 KB	Output is correct
12	Correct	90 ms	10232 KB	Output is correct
13	Correct	81 ms	10360 KB	Output is correct
14	Correct	77 ms	10404 KB	Output is correct
15	Correct	87 ms	10232 KB	Output is correct
16	Correct	88 ms	10304 KB	Output is correct
17	Correct	84 ms	10360 KB	Output is correct
18	Correct	801 ms	67680 KB	Output is correct
19	Correct	859 ms	67832 KB	Output is correct
20	Correct	911 ms	67728 KB	Output is correct
21	Correct	85 ms	10360 KB	Output is correct
22	Correct	82 ms	10232 KB	Output is correct
23	Correct	153 ms	5312 KB	Output is correct

Subtask #7
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	79 ms	10232 KB	Output is correct
3	Correct	91 ms	10336 KB	Output is correct
4	Correct	904 ms	67704 KB	Output is correct
5	Correct	88 ms	10232 KB	Output is correct
6	Correct	89 ms	10360 KB	Output is correct
7	Correct	92 ms	10364 KB	Output is correct
8	Correct	83 ms	10340 KB	Output is correct
9	Correct	86 ms	10232 KB	Output is correct
10	Correct	81 ms	10224 KB	Output is correct
11	Correct	79 ms	10360 KB	Output is correct
12	Correct	84 ms	10280 KB	Output is correct
13	Correct	85 ms	10232 KB	Output is correct
14	Correct	914 ms	67536 KB	Output is correct
15	Correct	78 ms	9724 KB	Output is correct
16	Correct	801 ms	67496 KB	Output is correct
17	Correct	824 ms	67460 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct

Subtask #8
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	8 ms	1280 KB	Output is correct
3	Correct	7 ms	1280 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	7 ms	1280 KB	Output is correct
17	Correct	81 ms	10272 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	0 ms	384 KB	Output is correct
21	Correct	0 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	0 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	365 ms	760 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	889 ms	68316 KB	Output is correct
31	Correct	829 ms	68252 KB	Output is correct
32	Correct	898 ms	68520 KB	Output is correct
33	Correct	0 ms	384 KB	Output is correct
34	Correct	827 ms	68304 KB	Output is correct
35	Correct	861 ms	68344 KB	Output is correct
36	Correct	816 ms	67704 KB	Output is correct
37	Correct	893 ms	67704 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	74 ms	10208 KB	Output is correct
40	Correct	77 ms	10312 KB	Output is correct
41	Correct	76 ms	10248 KB	Output is correct
42	Correct	82 ms	10232 KB	Output is correct
43	Correct	87 ms	10360 KB	Output is correct
44	Correct	81 ms	10232 KB	Output is correct
45	Correct	90 ms	10232 KB	Output is correct
46	Correct	81 ms	10360 KB	Output is correct
47	Correct	77 ms	10404 KB	Output is correct
48	Correct	87 ms	10232 KB	Output is correct
49	Correct	88 ms	10304 KB	Output is correct
50	Correct	84 ms	10360 KB	Output is correct
51	Correct	801 ms	67680 KB	Output is correct
52	Correct	859 ms	67832 KB	Output is correct
53	Correct	911 ms	67728 KB	Output is correct
54	Correct	85 ms	10360 KB	Output is correct
55	Correct	82 ms	10232 KB	Output is correct
56	Correct	153 ms	5312 KB	Output is correct
57	Correct	1 ms	384 KB	Output is correct
58	Correct	79 ms	10232 KB	Output is correct
59	Correct	91 ms	10336 KB	Output is correct
60	Correct	904 ms	67704 KB	Output is correct
61	Correct	88 ms	10232 KB	Output is correct
62	Correct	89 ms	10360 KB	Output is correct
63	Correct	92 ms	10364 KB	Output is correct
64	Correct	83 ms	10340 KB	Output is correct
65	Correct	86 ms	10232 KB	Output is correct
66	Correct	81 ms	10224 KB	Output is correct
67	Correct	79 ms	10360 KB	Output is correct
68	Correct	84 ms	10280 KB	Output is correct
69	Correct	85 ms	10232 KB	Output is correct
70	Correct	914 ms	67536 KB	Output is correct
71	Correct	78 ms	9724 KB	Output is correct
72	Correct	801 ms	67496 KB	Output is correct
73	Correct	824 ms	67460 KB	Output is correct
74	Correct	1 ms	384 KB	Output is correct
75	Correct	0 ms	384 KB	Output is correct
76	Correct	1 ms	384 KB	Output is correct
77	Correct	1 ms	384 KB	Output is correct
78	Correct	0 ms	384 KB	Output is correct
79	Correct	8 ms	1280 KB	Output is correct
80	Correct	907 ms	67228 KB	Output is correct
81	Correct	911 ms	67320 KB	Output is correct
82	Correct	983 ms	67328 KB	Output is correct
83	Correct	936 ms	67228 KB	Output is correct
84	Correct	982 ms	67176 KB	Output is correct
85	Correct	882 ms	67248 KB	Output is correct
86	Correct	155 ms	4216 KB	Output is correct
87	Correct	0 ms	384 KB	Output is correct

답안 #284620

Compilation message