Submission #1149092

#TimeUsernameProblemLanguageResultExecution timeMemory
1149092yeediotFinancial Report (JOI21_financial)C++20
100 / 100
395 ms23336 KiB
#pragma GCC optimize("O3") #include<bits/stdc++.h> using namespace std; #define F first #define S second #define all(x) x.begin(),x.end() #define pii pair<int,int> #define pb push_back #define sz(x) (int)(x.size()) #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) #define vi vector<int> #define vp vector<pii> #define vvi vector<vi> #define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) #define __lg(x) 63-__builtin_clzll(x) #define pow2(x) (1LL<<x) void __print(int x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef local void CHECK(); void setio(){ freopen("/Users/iantsai/cpp/input.txt","r",stdin); freopen("/Users/iantsai/cpp/output.txt","w",stdout); } #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else void setio(){} #define debug(x...) #endif #define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio(); const int mxn = 3e5 + 5; int a[mxn], to[mxn]; int find(int x){ return x == to[x] ? x : to[x] = find(to[x]); } void merge(int x, int y){ x = find(x), y = find(y); if(x == y) return; to[x] = y; } struct segtree{ int seg[4 * mxn]; void init(){ memset(seg, 0, sizeof(seg)); } void m(int l, int r, int id, int p, int v){ if(l == r){ chmax(seg[id], v); return; } int mm = l + r >> 1; if(p <= mm) m(l, mm, id * 2, p, v); else m(mm + 1, r, id * 2 + 1, p, v); seg[id] = max(seg[id * 2], seg[id * 2 + 1]); } int qry(int l, int r, int id, int ql, int qr){ if(qr < l or r < ql) return 0; if(ql <= l and r <= qr) return seg[id]; int mm = l + r >> 1; return max(qry(l, mm, id * 2, ql, qr), qry(mm + 1, r, id * 2 + 1, ql, qr)); } }tr; void solve(){ int n, d, ans = 1; cin >> n >> d; set<int>used; //tr.init(); vector<pii>ord; for(int i = 1; i <= n; i++){ cin >> a[i]; to[i] = i; ord.pb({a[i], -i}); } sort(all(ord)); for(auto p : ord){ int i = -p.S; auto it = used.insert(i).F; if(it != used.begin() and i - *prev(it) <= d) merge(i,*prev(it)); if(it != prev(used.end()) and *next(it) - *it <= d) merge(*next(it), i); int v = tr.qry(1, n, 1, find(i), i - 1) + 1; chmax(ans, v); tr.m(1, n, 1, i, v); } cout << ans << '\n'; } signed main(){ TOI_is_so_de; int t = 1; //cin >> t; while(t--){ solve(); } #ifdef local CHECK(); #endif } /* input: dp[i][j] */ #ifdef local void CHECK(){ cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n"; function<bool(string,string)> compareFiles = [](string p1, string p2)->bool { std::ifstream file1(p1); std::ifstream file2(p2); if(!file1.is_open() || !file2.is_open()) return false; std::string line1, line2; while (getline(file1, line1) && getline(file2, line2)) { if (line1 != line2)return false; } int cnta = 0, cntb = 0; while(getline(file1,line1))cnta++; while(getline(file2,line2))cntb++; return cntb - cnta <= 1; }; bool check = compareFiles("output.txt","expected.txt"); if(check) cerr<<"ACCEPTED\n"; else cerr<<"WRONG ANSWER!\n"; } #else #endif
#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...