Submission #949290

#TimeUsernameProblemLanguageResultExecution timeMemory
949290mansurBulldozer (JOI17_bulldozer)C++17
5 / 100
1 ms500 KiB
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3") #include<bits/stdc++.h> using namespace std; #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define sz(a) (int)a.size() #define s second #define f first using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}}; const int N = 2e6 + 1, mod = 998244353; const ll inf = 1e9; double eps = 1e-15; bool flg = 0; void slv() { int n; cin >> n; int x[n + 1], y[n + 1], w[n + 1]; vector<pii> s; for (int i = 1; i <= n; i++) { cin >> x[i] >> y[i] >> w[i]; s.push_back({x[i], w[i]}); } s.push_back({-inf, -inf}); sort(all(s)); ll p[n + 1], mn = 0, ans = 0; p[0] = 0; for (int i = 1; i <= n; i++) { p[i] = p[i - 1] + s[i].s; ans = max(ans, p[i] - mn); mn = min(mn, p[i]); } cout << ans; } main() { //freopen("rsq.in", "r", stdin); //freopen("rsq.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); int tp = 1; if (flg) cin >> tp; while (tp--) { slv(); } } //wenomechainsama

Compilation message (stderr)

bulldozer.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main() {
      | ^~~~
#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...