제출 #1309532

#제출 시각아이디문제언어결과실행 시간메모리
1309532zxzuamLightning Rod (NOI18_lightningrod)C++20
컴파일 에러
0 ms0 KiB
#include<cstdio> #include<cctype> #include <algorithm> //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("O3,unroll-loops,fast-math") //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //#define int long long #define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value using namespace std; //using namespace __gnu_pbds; template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x) { bool neg=false;int c=getchar(); for(;!isdigit(c);c=getchar())if(c=='-')neg=true; for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0')); if(neg)x=-x; } template<typename T>T& read(T &x){readmain(x);return x;} template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);} constexpr int maxn = 1e7 + 1; int a[maxn], b[maxn]; void solve(){ int n; read(n); int cnt = 0; /*tree< int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> s;*/ int mn = INT_MAX, mx = INT_MIN; for(int i = 1; i <= n; i++) { int x, y; read(x, y); mx = max(mx, y + x); a[i] = mx; b[i] = x - y; } for(int i = n; i >= 1; i--) { if(i == n) { if(a[i] > a[i - 1]) { cnt++; } } else if(i == 1) { if(mn > b[i]) { cnt++; } } else{ if(a[i] > a[i - 1] && mn > b[i]) { cnt++; } } mn = min(mn, b[i]); } printf("%d", cnt); } int main(){ //ios_base::sync_with_stdio(false); //cin.tie(nullptr); int tt = 1; //cin >> tt; while(tt--) { solve(); } }

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

Main.cpp: In function 'void solve()':
Main.cpp:33:14: error: 'INT_MAX' was not declared in this scope
   33 |     int mn = INT_MAX, mx = INT_MIN;
      |              ^~~~~~~
Main.cpp:4:1: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'?
    3 | #include <algorithm>
  +++ |+#include <climits>
    4 | //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
Main.cpp:37:9: error: 'mx' was not declared in this scope; did you mean 'x'?
   37 |         mx = max(mx, y + x);
      |         ^~
      |         x