oj.uz

답안 #124399

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124399 2019-07-03T09:31:38 Z AyaBenSaad 이상한 기계 (APIO19_strange_device) C++14
0 / 100
 616 ms 32472 KB 
#include <bits/stdc++.h>
#define ll long long 

using namespace std;

const int M = 1e6 + 6;
int n;
ll a, b;
stack <pair <ll, ll> > s;
pair <ll, ll> t[M], rem[M];

bool inter (ll a, ll b) {
  ll x = s.top().first;
  ll y = s.top().second;
  return ((a <= y && a >= x) || (b <= y && b >= x));
}
  
int main () {
  scanf ("%d %lld %lld", &n, &a, &b);
  for (int i = 0; i < n; i++) {
    scanf ("%lld %lld", &t[i].first, &t[i].second);
  }
  if (a < 3) {puts("1"); return 0;}
  sort (t, t+n);
  for (int i = 0; i < n; i++) {
    if (s.empty() || !inter(t[i].first, t[i].second)) {
      s.push ({t[i].first, t[i].second});
    }
    else {
      long long x = min (t[i].first, s.top().first);
      long long y = max (t[i].second, s.top().second);
      s.pop();
      s.push({x, y});
    }
  }
  int k = 0;
  while (s.size()) {
    if ((s.top().second - s.top().first + 1) / a >= 1) {printf("%lld\n", a); return 0;}
    long long x = s.top().first%a, y = s.top().second%a;
    if (x <= y) {t[k] = {x, y}; k++;}
    else {t[k] = {x, a-1}; k++; t[k] = {0, y};}
    s.pop();
  }

  sort (t, t+k);
  for (int i = 0; i < k; i++) {
    if (s.empty() || !inter(t[i].first, t[i].second)) {
      s.push ({t[i].first, t[i].second});
    }
    else {
      long long x = min (t[i].first, s.top().first);
      long long y = max (t[i].second, s.top().second);
      s.pop();
      s.push({x, y});
    }
  }
  long long ans = 0;

  while (s.size()) {
    ans += s.top().second-s.top().first+1;
    s.pop();
  }
  printf("%lld\n", ans);
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:19:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d %lld %lld", &n, &a, &b);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:21:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%lld %lld", &t[i].first, &t[i].second);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 5.0

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

Subtask #4
0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 20.0

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

Subtask #8
0 / 30.0

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