제출 #584390

#제출 시각아이디문제언어결과실행 시간메모리
584390Mr_HusanboyPinball (JOI14_pinball)C++14
11 / 100
1089 ms47388 KiB
// Muallif: Mansuraliyev Husanboy Murotali o'g'li >> NamPS #pragma GCC optimize("Ofast") #include<bits/stdc++.h> using namespace std; #define ll long long #define ull unsigned long long #define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define all(a) a.begin(), a.end() #define F first #define rep(x,start,end) for(int x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--)) #define S second #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++) #define fm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--) #define vii vector<int> #define vll vector<ll> // 0-9 >> 48-57; A-Z>>65-90 and a-z>>97-122 respectively; int n,m; struct dev{ int a,b,c,d; }; bool check(vector<dev> v){ vector<bool> rem(n+1); int cnt=0; set<int> st; for(int i=1;i<=n;i++){ int cur=i; for(dev u:v){ if(u.a<=cur&&cur<=u.b) cur=u.c; } st.insert(cur); } return st.size()==1; } void solve(){ cin>>m>>n; vector<dev> a(m); for(int i=0;i<m;i++){ cin>>a[i].a>>a[i].b>>a[i].c>>a[i].d; }ll ans=1e18; for(int i=0;i<(1<<m);i++){ vector<dev> v; ll sum=0; for(int j=0;j<m;j++){ if(i&(1<<j)) v.push_back(a[j]),sum+=a[j].d; } if(check(v)) ans=min(ans,sum); } cout<<(ans==1e18?-1:ans); } int main(){ ios; // int t; cin>>t; while(t--) solve(); }

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

pinball.cpp: In function 'bool check(std::vector<dev>)':
pinball.cpp:27:6: warning: unused variable 'cnt' [-Wunused-variable]
   27 |  int cnt=0;
      |      ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...