제출 #1112377

#제출 시각아이디문제언어결과실행 시간메모리
1112377vjudge1Baloni (COCI15_baloni)C++17
0 / 100
40 ms7248 KiB
#include <bits/stdc++.h> #define int long long #define pb push_back #define nmod(a, b) (((a%b)+b)%b) // stands for [n]atural [mod], as in "will always return a natural number", should be used in case of negative #define a2b(a, b) (a << b) // a*2^b #define bit(a, b) ((a >> b) & 1) // bth bit from the right, starts at zero using namespace std; template<class T> using vec = vector<T>; const int INFTY = (1LL << 63) - 1; const int NNFTY = 1LL << 63; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; vec<int> h(n); for (auto &x : h) cin >> x; int k = 1; for (int i = 0; i < n - 1; i++) if (h[i] != h[i + 1] + 1) k++; cout << k; }

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

baloni.cpp:10:31: warning: integer overflow in expression of type 'long long int' results in '9223372036854775807' [-Woverflow]
   10 | const int INFTY = (1LL << 63) - 1;
      |                   ~~~~~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...