제출 #108754

#제출 시각아이디문제언어결과실행 시간메모리
108754JatanaPinball (JOI14_pinball)C++17
0 / 100
3 ms512 KiB
#ifdef aimbot #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #pragma GCC optimize("unroll-loops") #endif #include <iostream> #include <vector> #include <algorithm> #include <cmath> #include <string> #include <unordered_map> #include <unordered_set> #include <map> #include <set> #include <queue> #include <ostream> #include <istream> #include <typeinfo> #include <iomanip> #include <cstdio> #include <cstdlib> #include <cassert> #include <limits> #include <fstream> #include <array> #include <list> #include <bitset> #include <functional> #include <random> #include <cstring> #include <chrono> #define random escape__from__random__aetuhoetnuhshe #define mt make_tuple #define x first #define y second #define pb push_back #define ppb pop_back #define mp make_pair #define umap unordered_map #define uset unordered_set #define elif else if #define len(v) ((int)v.size()) #define f(i, n) for (int i = 0; i < (n); i++) #define rof(i, n) for (int i = ((n) - 1); i >= 0; i--) #define apply(v, act) for (auto &x : v) { act; } #define log(args...) {string s = #args;deque<string> deq;\ string buf = "";int bal = 0;for (char c : s) {\ if (c == '(' || c == '[' || c == '{') {bal++;\ } else if (c == ')' || c == ']' || c == '}') {\ bal--;} else {if (bal == 0) {if (c == ',') {\ deq.pb(buf);buf = "";} else {if (c != ' ') {\ buf += c;}}}}}if (!buf.empty()) {deq.pb(buf);}\ smart_io::precall_print();smart_io::_print(deq, args);} inline int min(const int &x, const int &y) { return (((y-x)>>(32-1))&(x^y))^x; } inline int max(const int &x, const int &y) { return (((y-x)>>(32-1))&(x^y))^y; } inline long long min(const long long &x, const long long &y) { return (((y-x)>>(64-1))&(x^y))^x; } inline long long max(const long long &x, const long long &y) { return (((y-x)>>(64-1))&(x^y))^y; } #define print \ smart_io::precall_print(); \ cout, #define scan cin, #ifdef fast_allocator const int MAXMEM = 200 * 1000 * 1024; char _memory[MAXMEM]; size_t _ptr = 0; void* operator new(size_t _x) { _ptr += _x; assert(_ptr < MAXMEM); return _memory + _ptr - _x; } void operator delete (void*) noexcept {} #endif using namespace std; char string_in_buffer[(int)260]; void fast_scan(int &x) { scanf("%d", &x); } void fast_scan(long long &x) { scanf("%lld", &x); } void fast_scan(unsigned long long &x) { scanf("%llu", &x); } void fast_scan(double &x) { scanf("%lf", &x); } void fast_scan(long double &x) { scanf("%Lf", &x); } void fast_scan(char &x) { scanf("%c", &x); if (x == '\n') { fast_scan(x); } } void fast_scan(string &x) { scanf("%s", string_in_buffer); x = string(string_in_buffer); } template<class TFirst, class TSecond> void fast_scan(pair<TFirst, TSecond> &p) { fast_scan(p.first); fast_scan(p.second); } template <class T> void fast_scan(vector<T> &v) { for (auto &x : v) fast_scan(x); } void fast_print(const int &x) { printf("%d", x); } void fast_print(const unsigned int &x) { printf("%u", x); } void fast_print(const long long &x) { printf("%lld", x); } void fast_print(const unsigned long long &x) { printf("%llu", x); } void fast_print(const double &x) { printf("%.15lf", x); } void fast_print(const long double &x) { printf("%.15Lf", x); } void fast_print(const char &x) { printf("%c", x); }; void fast_print(const string &x) { printf("%s", x.c_str());} void fast_print(const char v[]) { fast_print((string)v); } template<class TFirst, class TSecond> void fast_print(const pair<TFirst, TSecond> &p) { fast_print(p.first); fast_print(' '); fast_print(p.second); } template <class T> void fast_print(const vector<T> &v) { if (v.empty()) return; fast_print(v[0]); for (int i = 1; i < v.size(); i++) { fast_print(' '); fast_print(v[i]); } } template <class T> void fast_print(const vector<vector<T>> &v) { if (v.empty()) return; fast_print(v[0]); for (int i = 1; i < v.size(); i++) { fast_print('\n'); fast_print(v[i]); } } template <class T> void fast_print(const T &v) { for (const auto &x : v) { fast_print(x); fast_print(' '); } } using namespace std; namespace smart_io { string print_start = ""; string sep = " "; bool first_print = false; void precall_print() { fast_print(print_start); print_start = "\n"; first_print = true; } void _print(deque<string>) {} template<class T, class... Args> void _print(deque<string> names, T elem, Args... args) { if (!first_print) { fast_print("\n"); } else { first_print = false; } fast_print(names.front()); fast_print(" = "); fast_print(elem); names.pop_front(); _print(names, args...); } } //namespace smart_io template <class T> ostream &operator,(ostream &os, const T &object) { if (!smart_io::first_print) { fast_print(smart_io::sep); } else { smart_io::first_print = false; } fast_print(object); return os; } template <class T> istream &operator,(istream &is, T &object) { fast_scan(object); return is; } namespace random { using namespace std::chrono; mt19937 rng(duration_cast< milliseconds >( system_clock::now().time_since_epoch() ).count()); uniform_real_distribution<> prob_dist(0.0, 1.0); }; namespace typedefs { typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef long double ld; } namespace numbers_operation { template<class T> T floor_mod(T a, T b) { if (a >= 0 && b >= 0) return a % b; if (a <= 0 && b <= 0) return a % b; return abs(b) - (abs(a) % abs(b)); } } using namespace numbers_operation; using namespace typedefs; using namespace random; int m, n; struct Border { int l, m, r, cost; }; vector<Border> v; const int N = (1 << 20); struct TS { ll T[2 * N + 1]; void _set(int i, ll value) { i += N - 1; T[i] = value; while (i) { i = (i - 1) / 2; T[i] = min(T[i * 2 + 1], T[i * 2 + 2]); } } ll query(int i, int tl, int tr, int ql, int qr) { if (tr <= ql || qr <= tl) return 1e18; if (ql <= tl && tr <= qr) return T[i]; int m = (tl + tr) / 2; return min(query(i * 2 + 1, tl, m, ql, qr), query(i * 2 + 2, m, tr, ql, qr)); } }; signed main(signed argc, char *argv[]) { scan m, n; v.resize(m); vector<int> cords; cords.pb(n); cords.pb(1); f(i, m) { scan v[i].l, v[i].r, v[i].m, v[i].cost; cords.pb(v[i].l); cords.pb(v[i].r); cords.pb(v[i].m); } sort(cords.begin(), cords.end()); cords.resize(unique(cords.begin(), cords.end()) - cords.begin()); f(i, m) { v[i].l = lower_bound(cords.begin(), cords.end(), v[i].l) - cords.begin(); v[i].r = lower_bound(cords.begin(), cords.end(), v[i].r) - cords.begin(); v[i].m = lower_bound(cords.begin(), cords.end(), v[i].m) - cords.begin(); } ll rez = 1e18; TS L, R; { f(i, len(cords)) { L._set(i, 1e18); R._set(i, 1e18); } L._set(0, 0); R._set(len(cords) - 1, 0); f(i, m) { { ll sub = L.query(0, 0, N, v[i].l, v[i].r + 1) + R.query(0, 0, N, v[i].l, v[i].r + 1) + v[i].cost; rez = min(rez, sub); } { ll cur = L.query(0, 0, N, v[i].m, v[i].m + 1); ll w = v[i].cost + L.query(0, 0, N, v[i].l, v[i].r + 1); if (w < cur) L._set(v[i].m, w); } { ll cur = R.query(0, 0, N, v[i].m, v[i].m + 1); ll w = v[i].cost + R.query(0, 0, N, v[i].l, v[i].r + 1); if (w < cur) R._set(v[i].m, w); } } } print rez; }

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

pinball.cpp: In function 'void fast_scan(int&)':
pinball.cpp:83:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(int &x) { scanf("%d", &x); }
                          ~~~~~^~~~~~~~~~
pinball.cpp: In function 'void fast_scan(long long int&)':
pinball.cpp:84:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(long long &x) { scanf("%lld", &x); }
                                ~~~~~^~~~~~~~~~~~
pinball.cpp: In function 'void fast_scan(long long unsigned int&)':
pinball.cpp:85:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
                                         ~~~~~^~~~~~~~~~~~
pinball.cpp: In function 'void fast_scan(double&)':
pinball.cpp:86:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(double &x) { scanf("%lf", &x); }
                             ~~~~~^~~~~~~~~~~
pinball.cpp: In function 'void fast_scan(long double&)':
pinball.cpp:87:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(long double &x) { scanf("%Lf", &x); }
                                  ~~~~~^~~~~~~~~~~
pinball.cpp: In function 'void fast_scan(char&)':
pinball.cpp:89:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%c", &x);
  ~~~~~^~~~~~~~~~
pinball.cpp: In function 'void fast_scan(std::__cxx11::string&)':
pinball.cpp:95:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", string_in_buffer);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...