제출 #1200943

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1200943		Mighilon	Ljeto (COCI21_ljeto)	C++20	50 / 50	0 ms	328 KiB

Main

#include <bits/stdc++.h>
using namespace std;
 
#ifdef DEBUG
#include "../Library/debug.h"
#else
#define dbg(x...)
#endif
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
 
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i)
#define trav(a, x) for (auto& a : x)
#define f first 
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
 
const char nl = '\n';
const int INF = 1e9;
const int MOD = 1e9 + 7;
 
void solve(){
    int n;
    cin>>n;
    int ta=0,tb=0;
    map<int,int> mp;
    F0R(i,8){
        mp[i+1]=-100;
    }
    F0R(i,n){
        int t,a,b;cin>>t>>a>>b;
        if(a<=4){
            ta+=100;
            if(t-mp[a]<=10)
                ta+=50;
            mp[a]=t;
        }
        else{
            tb+=100;
            if(t-mp[a]<=10)
                tb+=50;
            mp[a]=t;
        }
    }
    cout<<ta<<" "<<tb<<nl;
}
 
int32_t main(){
    ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    
    int TC = 1;
    // cin >> TC;
    while(TC--){
        solve();
    }
    return 0;
}

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