제출 #128169

#제출 시각아이디문제언어결과실행 시간메모리
128169claudy다리 (APIO19_bridges)C++14
0 / 100
3076 ms376 KiB
//# pragma GCC optimize("Ofast,no-stack-protector") //# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") # pragma GCC optimize("Ofast") # pragma GCC optimization ("unroll-loops") # include "bits/stdc++.h" std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}}; # define ll long long # define clock (clock() * 1000.0 / CLOCKS_PER_SEC) # define rc(s) return cout << s,0 # define rcg(s) cout << s;exit(0) # define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0); # define db(x) cerr << #x << " = " << x << '\n' # define pb push_back # define mp make_pair # define all(s) s.begin(),s.end() # define sz(x) (int)((x).size()) //# define int ll using namespace std; // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ # define LOCAL # define sim template < class c # define ris return * this # define dor > debug & operator << # define eni(x) sim > typename \ enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { #ifdef LOCAL ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } #else sim dor(const c&) { ris; } #endif }; #define show(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " int gcd(int a, int b) { if(b) return gcd(b,a%b); return a; }mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ int L = 500; int pos,f[1 << 17],mn[1 << 17],n,m,a[1 << 17],b[1 << 17],c[1 << 17],q; void upd(int pos,int val) { pos--; f[pos] = val; int block = pos / L; mn[block] = val; for(int i = block * L;i < block * (L + 1);i++) mn[block] = min(mn[block],f[i]); } int qry(int pos,int val) { pos--; int blockl = pos / L; while(blockl && mn[blockl] >= val) blockl--; int blockr = pos / L; while(blockr <= n / L && mn[blockr] >= val) blockr++; int a = blockl * (L + 1) - 1; while(mn[a] >= val && a) a--; int b = blockr * L; while(mn[b] >= val && b <= n - 2) b++; return min(n - 2,b) - max(0,a) + 1; } int32_t main(){_ //freopen("input","r",stdin); for(int i = 0;i <= n + 1000;n++) f[i] = mn[i] = 1e9; cin >> n >> m; for(int i = 1;i <= m;i++) { cin >> a[i] >> b[i] >> c[i]; upd(min(a[i],b[i]),c[i]); } cin >> q; while(q--) { int t,x,y; cin >> t >> x >> y; if(t == 1) upd(min(a[x],b[x]),y); else { cout << qry(x,y) << '\n'; } } return 0; }

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

bridges.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 # pragma GCC optimization ("unroll-loops")
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...