Submission #1260445

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260445		herominhsteve	Ljeto (COCI21_ljeto)	C++20	50 / 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;
	Spray(int T=0,int S=0,int H=0){
		time=T;
		shot=S;
		hit=H;
	}
};

int n;
vector<Spray> team1,team2;

void init(){
	cin>>n;
	for (int i=0;i<n;i++){
		int time,s,h;
		cin>>time>>s>>h;
		if (s<=4) team1.emplace_back(time,s,h);
		else team2.emplace_back(time,s,h);
	}
}

int calPoint(vector<Spray> &team){
	int curteam=0;
	int n =team.size();
	vector<int> last(9,-1);
	for (int i=0;i<n;i++){
		if (abs(last[team[i].shot] - team[i].time)<=10 and ~last[team[i].shot]) curteam+=150;
		else curteam+=100;
		last[team[i].shot] = team[i].time; 
	}
	return curteam;
}

void sol(){
	cout<<calPoint(team1)<<" "<<calPoint(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: 25 / 25