Submission #755973

#TimeUsernameProblemLanguageResultExecution timeMemory
755973vjudge1Pinball (JOI14_pinball)C++17
0 / 100
0 ms340 KiB
#include<bits/stdc++.h> typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef double db; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define pbds tree<pair<int, int>, null_type, less<pair<int, int>>,rb_tree_tag, tree_order_statistics_node_update> using namespace __gnu_pbds; ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD) ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM) int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1}; int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1}; #define endl "\n" #define ss second #define ff first #define all(x) (x).begin() , (x).end() #define pb push_back #define vi vector<int> #define vii vector<pair<int,int>> #define vl vector<ll> #define vll vector<pair<ll,ll>> #define pii pair<int,int> #define pll pair<ll,ll> #define pdd pair<double,double> #define vdd vector<pdd> #define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; ////////////////////Only Clear Code////////////////////////// void usaco_problem(){ freopen("milkvisits.in", "r", stdin); freopen("milkvisits.out", "w", stdout); } void init(){ #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif // ONLINE_JUDGE } const int mx = 1005; const int LOG = 25; const ll inf = 1e18; const ll mod = 1e9+7; int a[mx], b[mx], c[mx], d[mx]; set<int> nxt[mx]; int m; bool verify(vector<vi> v, vi used){ sort(all(v)); int n = v.size(); if(v[0][0] != 1)return 0; int r = v[0][1]; for(int i = 1; i < n;i++){ if(v[i][0] > r+1){ return 0; } r = max(r, v[i][1]); } if(r != m)return 0; int c = 0; for(int i : used){ if(nxt[i].empty())c++; } if(c >= 2){ return 0; } return 1; } void run_case(){ int n;cin >> n >> m; vector<vi> v; vi x; for(int i = 0; i < n;i++){ x.pb(i); cin >> a[i] >> b[i] >> c[i] >> d[i]; v.pb({a[i], b[i], i}); } for(int i = 0; i < n;i++){ for(int j = i+1;j < n;j++){ if(c[i] >= a[j] && c[i] <= b[j]){ nxt[i].insert(j); } } } if(!verify(v, x)){ cout << -1 << endl; return; } ll ans = inf; for(int mask = 1; mask < (1 << n);mask++){ vector<vi> v; vi used; ll cost = 0; for(int j = 0;j < n;j++){ if((1 << j) & mask){ used.pb(j); v.pb({a[j], b[j], j}); cost += d[j]; nxt[j].clear(); } } for(int i : used){ for(int j : used){ if(j <= i)continue; if(c[i] >= a[j] && c[i] <= b[j]){ nxt[i].insert(j); } } } if(verify(v, used)){ ans = min(ans, cost); } } cout << ans << endl; } int main(){ //init(); speed; int t; //cin >> t; t = 1; while(t--){ run_case(); } } /* NEVER GIVE UP! DOING SMTHNG IS BETTER THAN DOING NTHNG!!! Your Guide when stuck: - Continue keyword only after reading the whole input - Don't use memset with testcases - Check for corner cases(n=1, n=0) - Check where you declare n(Be careful of declaring it globally and in main) */

Compilation message (stderr)

pinball.cpp: In function 'void usaco_problem()':
pinball.cpp:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pinball.cpp:34:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pinball.cpp: In function 'void init()':
pinball.cpp:40:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
pinball.cpp:42:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...