답안 #279328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
279328 2020-08-22T05:46:29 Z Nodir_Bobiev 이상한 기계 (APIO19_strange_device) C++17
10 / 100
384 ms 32312 KB
/*
+----------------------------------------------------------------+
| In the name of Allah, the most Gracious and the most Merciful. |
+----------------------------------------------------------------+
Our hearts quake with fear of you
Our hearts wake with love for you
And to Islam we must be true
In everything we think and do.
--------------------------------
When your heart is breaking
And your pain makes you fall
Remember just remember
Allah Sees it all.
*/
# include <bits/stdc++.h>
# define FILE
using namespace std;

long long n, A, B, S, L;
vector < pair < long long, long long > > tim;

void Subtask1(){
    set < pair < long long , long long> > st;
    for( auto tm: tim ){
        for( long long i = tm.first; i <= tm.second; i ++ ){
            st.insert({(i+i/B)%A, i%B});
        }
    }
    cout << st.size();
    exit( 0 );
}

int main(){
    # ifdef FILEs
        freopen( "input.txt", "r", stdin );
        freopen( "output.txt", "w", stdout );
    # endif
    ios_base::sync_with_stdio(false);
    cin >> n >> A >> B;
    for( int i = 1; i <= n; i ++ ){
        long long l, r; cin >> l >> r;
        tim.push_back( {l,r} );
        S += r - l + 1;
        L = max( L, l );
    }
    if( S <= 1000000)Subtask1();
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 41 ms 12920 KB Output is correct
3 Correct 63 ms 18548 KB Output is correct
4 Correct 2 ms 896 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 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 8 ms 1280 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 40 ms 7032 KB Output is correct
16 Correct 26 ms 7296 KB Output is correct
17 Correct 62 ms 11884 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 119 ms 32312 KB Output is correct
3 Correct 123 ms 32120 KB Output is correct
4 Correct 114 ms 30712 KB Output is correct
5 Incorrect 309 ms 23892 KB Output isn't correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 384 ms 26672 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 384 ms 26672 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 384 ms 26672 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 40 ms 5740 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 41 ms 12920 KB Output is correct
3 Correct 63 ms 18548 KB Output is correct
4 Correct 2 ms 896 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 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 8 ms 1280 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 40 ms 7032 KB Output is correct
16 Correct 26 ms 7296 KB Output is correct
17 Correct 62 ms 11884 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Incorrect 1 ms 384 KB Output isn't correct
21 Halted 0 ms 0 KB -