oj.uz

Submission #755891

# Submission time Handle Problem Language Result Execution time Memory
755891 2023-06-10T17:24:33 Z MarwenElarbi Pinball (JOI14_pinball) C++14
11 / 100
 535 ms 4232 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = 1e9+9;
const int nax = 1e3+5;
const int MAX_VAL = 1e6;
double PI=3.14159265359;
int arx[8]={1,1,0,-1,-1,-1, 0, 1};
int ary[8]={0,1,1, 1, 0,-1,-1,-1};
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
int main(){
    optimise;
    /*#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif*/
    //setIO("redistricting");
    int n,m;
    cin>>m>>n;
    vll tab(m);
    vl c(m);
    vl cost(m);
    for (int i = 0; i < m; ++i)
    {   
        cin>>tab[i].fi>>tab[i].se;
        cin>>c[i];
        cin>>cost[i];
    }
    ll res=1e18;
    int h[n+1];
    for (int i = 0; i < (1<<m) ; ++i)
    {
        for (int k = 1; k <= n; ++k)
        {
            h[k]=1;
        }
        ll cur=0;
        for (int j = 0; j < m; ++j)
        {
            if (i&(1<<j)){
                //cout<< i<<" "<<j<<endl;
                cur+=cost[j];
                for (int k = tab[j].fi; k <= tab[j].se; ++k)
                {
                    h[k]=0;
                }
                h[c[j]]=1;
            }
        }
        int sum=0;
        for (int k = 1; k <= n; ++k)
        {
           if(h[k]==1) sum++;
        }
        if (sum==1) res=min(res,cur);
    }
    if (res==1e18) cout <<-1<<endl;
    else cout << res<<endl;
}

Compilation message

pinball.cpp: In function 'void setIO(std::string)':
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((s + ".in").c_str(), "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((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 2 ms 324 KB Output is correct
8 Correct 2 ms 212 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 2 ms 324 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Incorrect 535 ms 4232 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 2 ms 324 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Incorrect 535 ms 4232 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 2 ms 324 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Incorrect 535 ms 4232 KB Output isn't correct
10 Halted 0 ms 0 KB -