Submission #1260433

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260433		herominhsteve	Ljeto (COCI21_ljeto)	C++20	25 / 50	0 ms	328 KiB

Main

#include <bits/stdc++.h>
#define el '\n'
#define FNAME "NAME"
#define allof(x) x.begin(),x.end()
#define allof1(x) x.begin()+1,x.end()
#define mset(x,n) memset(x,(n),sizeof(x))
using namespace std;
const long long MOD = (long long) 1e9+7;
template<class X,class Y> bool minimize(X &a,Y b){ if (a>b) {a=b; return true;} return false;}
template<class X,class Y> bool maximize(X &a,Y b){ if (a<b) {a=b; return true;} return false;}

void setup(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
	if (fopen(FNAME".inp","r")){
		freopen(FNAME".inp","r",stdin);
		freopen(FNAME".out","w",stdout);
	}
}

struct Spray{
	int time;
	int shot,hit;
	int shotT,hitT;
	Spray(int T=0,int S=0,int H=0){
		time=T;
		shot=S;
		hit=H;
	}
};

int n;
vector<Spray> a;

void init(){
	cin>>n;
	a.resize(n);
	for (Spray &x:a) cin>>x.time>>x.shot>>x.hit;
}

void sol(){
	long long team1=0,team2=0;
	for (int i=0;i<n;i++){
		long long &curteam = (a[i].shot <= 4 ? team1 : team2);
		int curtime = a[i].time;
		curteam+=100;
		int j = i+1;
		int cnt=0;
		while (j<n and (a[j].time-curtime) <= 10 and a[j].shot==a[i].shot){
			curteam += 150;
			curtime = a[j].time;
			j++;
		}
		i = j-1;
	}
	cout<<team1<<" "<<team2;
}

int main(){
    setup();
    init();
    sol();
}

Compilation message (stderr)

Main.cpp: In function 'void setup()':
Main.cpp:16:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |                 freopen(FNAME".inp","r",stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:17:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |                 freopen(FNAME".out","w",stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

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