Submission #1305088

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305088		muhammad-mutahir	Ljeto (COCI21_ljeto)	C++20	50 / 50	1 ms	580 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}


 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q; 
 
void solve(int testcase_number){
     cin>>n;
     vector<int>lasp(4,-inf);
     vector<int>lasb(4,-inf);
     int p = 0;
     int b = 0;
     while(n--){
     	int t,a,b1;
     	cin>>t>>a>>b1;
     	// cout<<
     	if(a<=4){
     		if(t-lasp[a-1] <=10){
     			p+=150;
     		}
     		else{
     			p+=100;
     		}
     		lasp[a-1] = t;
     	}
     	else{
     		a-=4;
     		if(t-lasb[a-1] <= 10){
     			b+=150;
     		}
     		else{
     			b+=100;
     		}
     		lasb[a-1] = t;     		
     		
     	}
     	
     }
     cout<<p<<" "<<b<<endl;
     



}


signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 25 / 25