제출 #378155

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
378155		JerryLiu06	Strange Device (APIO19_strange_device)	C++11	5 / 100	802 ms	69272 KiB

strange_device

#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 = 1 << 60; 

    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(); ) { ll NOW = E[i].f;
         while (i < E.size() && E[i].f == NOW) cur += E[i++].s; ans++;

         if (prev > 0) ans += E[i - 1].f - PREV - 1; prev = cur; PREV = NOW;
     }
    cout << ans << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

strange_device.cpp: In function 'int main()':
strange_device.cpp:17:65: warning: left shift count >= width of type [-Wshift-count-overflow]
   17 |     cin >> N >> A >> B; ll MOD = A * B; if (MOD < 0) MOD = 1 << 60;
      |                                                                 ^~
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(); ) { ll NOW = E[i].f;
      |                      ~~^~~~~~~~~~
strange_device.cpp:27:19: 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 |          while (i < E.size() && E[i].f == NOW) cur += E[i++].s; ans++;
      |                 ~~^~~~~~~~~~
strange_device.cpp:27:10: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   27 |          while (i < E.size() && E[i].f == NOW) cur += E[i++].s; ans++;
      |          ^~~~~
strange_device.cpp:27:65: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   27 |          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 += E[i - 1].f - PREV - 1; prev = cur; PREV = NOW;
      |          ^~
strange_device.cpp:29:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   29 |          if (prev > 0) ans += E[i - 1].f - PREV - 1; prev = cur; PREV = NOW;
      |                                                      ^~~~
strange_device.cpp:24:72: warning: unused variable 'NOW' [-Wunused-variable]
   24 |     sort(begin(E), end(E)); int prev = 0; int cur = 0; ll PREV = 0; ll NOW = 0;
      |                                                                        ^~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 5
• Subtask 3: 5 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 30