oj.uz

답안 #378173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378173 2021-03-16T06:15:55 Z JerryLiu06 이상한 기계 (APIO19_strange_device) C++11
5 / 100
 750 ms 33552 KB 
#include <bits/stdc++.h>
#include <iostream>

using namespace std;

typedef long long ll;
typedef pair<ll, int> pli;

#define f first 
#define s second

int N; ll A, B, ans = 0; vector<pli> E;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> N >> A >> B; ll MOD = A * B; if (MOD <= 0 || MOD > 1000000000000000000L) MOD = 1000000000000000010L;
    
    for (int i = 0; i < N; i++) { ll X, Y; cin >> X >> Y; X %= MOD; Y %= MOD;
        if (X <= Y) { E.push_back({X, 1}); E.push_back({Y, -1}); }

        else { E.push_back({0, 1}); E.push_back({Y, -1}); E.push_back({X, 1}); E.push_back({MOD - 1, -1}); }
    }
    sort(begin(E), end(E)); int prev = 0; int cur = 0; ll PREV = 0; ll NOW = 0;
    
     for (int i = 0; i < E.size(); ) {
         NOW = E[i].f; while (i < E.size() && E[i].f == NOW) cur += E[i++].s; ans++;

         if (prev > 0) ans += NOW - PREV - 1; prev = cur; PREV = NOW;
     }
     cout << ans << endl;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:26:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |      for (int i = 0; i < E.size(); ) {
      |                      ~~^~~~~~~~~~
strange_device.cpp:27:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |          NOW = E[i].f; while (i < E.size() && E[i].f == NOW) cur += E[i++].s; ans++;
      |                               ~~^~~~~~~~~~
strange_device.cpp:29:10: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   29 |          if (prev > 0) ans += NOW - PREV - 1; prev = cur; PREV = NOW;
      |          ^~
strange_device.cpp:29:47: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   29 |          if (prev > 0) ans += NOW - PREV - 1; prev = cur; PREV = NOW;
      |                                               ^~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 6 ms 1008 KB Output is correct
3 Correct 6 ms 1008 KB Output is correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

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

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 573 ms 33552 KB Output is correct
3 Incorrect 546 ms 33456 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 573 ms 33552 KB Output is correct
3 Incorrect 546 ms 33456 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 573 ms 33552 KB Output is correct
3 Incorrect 546 ms 33456 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 61 ms 4580 KB Output is correct
3 Correct 61 ms 4580 KB Output is correct
4 Correct 750 ms 33340 KB Output is correct
5 Correct 63 ms 4580 KB Output is correct
6 Correct 61 ms 4580 KB Output is correct
7 Correct 61 ms 4580 KB Output is correct
8 Correct 78 ms 4544 KB Output is correct
9 Correct 60 ms 4740 KB Output is correct
10 Correct 73 ms 4580 KB Output is correct
11 Correct 66 ms 4580 KB Output is correct
12 Correct 56 ms 4580 KB Output is correct
13 Correct 68 ms 4580 KB Output is correct
14 Correct 730 ms 33340 KB Output is correct
15 Incorrect 63 ms 4580 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 6 ms 1008 KB Output is correct
3 Correct 6 ms 1008 KB Output is correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -