제출 #1222967

#제출 시각아이디문제언어결과실행 시간메모리
1222967ByeWorldRMQ (NOI17_rmq)C++17
67 / 100
1096 ms6720 KiB
#include <bits/stdc++.h> #pragma GCC optimize("O3") // #define int long long #define ll long long #define se second #define fi first #define pb push_back #define lf (id<<1) #define rg ((id<<1)|1) #define md ((l+r)>>1) using namespace std; typedef pair<int,int> pii; typedef pair<int,pii> ipii; const int MAXN = 2e5+10; const int MAXA = 5e7+10; const int SQRT = 450; const int INF = 1e9; const int MOD = 998244353; const int LOG = 20; int sum(int a, int b){ a%=MOD; b%=MOD; return (a+MOD+b)%MOD; } void chsum(int &a, int b){ a%=MOD; b%=MOD; a = (a+MOD+b)%MOD; } int mul(int a, int b){ return (a*b)%MOD; } int expo(int a, int b){ if(b==0) return 1; int te = expo(a, b/2); te = mul(te,te); return (b%2 ? mul(te,a) : te); } void chmul(int &a, int b){ a = (a*b)%MOD; } void chmn(auto &a, auto b){ a = min(a, b); } void chmx(auto &a, auto b){ a = max(a, b); } int n, m, ans[MAXN]; vector<pii> vec[MAXN]; bool can = 1; int ban[MAXN]; int le[MAXN], ri[MAXN]; signed main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n>>m; for(int i=1; i<=m; i++){ int x, y, p; cin>>x>>y>>p; x++; y++; p++; vec[p].pb({x,y}); } vec[1].pb({1,n}); for(int i=n; i>=1; i--){ if(vec[i].empty()) continue; sort(vec[i].begin(), vec[i].end()); int mn = INF, mx = -1; for(auto [l, r] : vec[i]) chmn(mn, r), chmx(mx, r); if(mn < vec[i].back().fi) can = 0; bool ada = 0; // cout << i << " i\n"; // cout << vec[i].back().fi << ' ' << mn << " mn\n"; for(int j=vec[i].back().fi; j<=mn; j++){ if(ban[j] == 0){ ans[j] = i, ada = 1; break; } } // for(int j=1; j<=n; j++) cout << ans[j] << " \n"[j==n]; // cout << " pp\n"; if(!ada) can = 0; // le - ri gk boleh dipake le[i] = vec[i][0].fi; ri[i] = mx; for(int j=le[i]; j<=ri[i]; j++) ban[j]++; } for(int i=1; i<=n; i++){ if(!vec[i].empty()){ for(int j=le[i]; j<=ri[i]; j++) ban[j]--; continue; } bool ada = 0; for(int j=1; j<=n; j++){ if(ban[j]==0 && ans[j]==0){ ans[j] = i; ada = 1; break; } } if(!ada) can = 0; } for(int i=1; i<=n; i++) if(ans[i]==0) can = 0; if(!can){ for(int i=1; i<=n; i++) cout << "-1 "; cout << '\n'; exit(0); } for(int i=1; i<=n; i++) cout << ans[i]-1 << " \n"[i==n]; }

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

rmq.cpp:29:11: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   29 | void chmn(auto &a, auto b){ a = min(a, b); }
      |           ^~~~
rmq.cpp:29:20: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   29 | void chmn(auto &a, auto b){ a = min(a, b); }
      |                    ^~~~
rmq.cpp:30:11: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   30 | void chmx(auto &a, auto b){ a = max(a, b); }
      |           ^~~~
rmq.cpp:30:20: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   30 | void chmx(auto &a, auto b){ a = max(a, b); }
      |                    ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...