oj.uz

Submission #908881

# Submission time Handle Problem Language Result Execution time Memory
908881 2024-01-17T01:06:11 Z vjudge1 Pinball (JOI14_pinball) C++17
11 / 100
 2 ms 348 KB 
#include <bits/stdc++.h>

#define S second 
#define F first
#define ll long long

#define L F.F 
#define R F.S
#define O S.F

#define P S.S


using namespace std;

ll n, m,xd, arr[1006], res=100000000000, zd;
pair<pair<ll,ll>,pair<ll,ll>> b[100];
char c;
string s;

set<string> f;

int main(){
    cin>>m>>n;
    
    xd=1;
    
    for(int i=0; i<m; i++)xd*=2;
    
    for(int i=0; i<m; i++)cin>>b[i].L>>b[i].R>>b[i].O>>b[i].P;
    
    for(int i=0; i<xd; i++){
        zd=i;
        ll sp=0;ll dm=0;
        for(int h=0; h<=n; h++)arr[h]=0;
        for(int j=0; j<m; j++){
            
            if(zd%2){
                
                for(int h=b[j].L; h<=b[j].R; h++){
                    arr[h]=1;
                }
                arr[b[j].O]=0;
                dm+=b[j].P;
            }
            zd/=2;
            //cout<<1;
        }
        
        for(int h=1; h<=n; h++){
                if(!arr[h])sp++;
            }
            
            if(sp<=1)res=min(res, dm);
        
    }
    
    if(res!=100000000000)cout<<res; 
    
    else cout<<-1;
    
    
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Incorrect 1 ms 344 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Incorrect 1 ms 344 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Incorrect 1 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -