Submission #715528

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
715528	2023-03-27T07:17:09 Z	Koful123	ACM (COCI19_acm)	C++17	0 / 50	2 ms	556 KB

acm

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

struct str{
	string s;
	bool operator < (const str other) const{
		int sz = min(other.s.size(),s.size());
		for(int i = 0; i < sz; i++){
			if(s[i] != other.s[i]){
				return s[i] < other.s[i];
			}
		}
		return s.size() < other.s.size();
	};
};

void solve(){
	
	int n,m,pos;
	cin >> n >> m;

	vector<pair<pair<int,int>,str>> v(n);	
	for(int i = 0; i < n; i++){
		cin >> v[i].ss.s;
		for(int j = 0; j < m; j++){
			string q; cin >> q;
			if(q[0] == '-'){
				if(q.size() > 1){
					v[i].ff.ss += 20 * 60 * (q[1] - '0');
				}
				continue;
			}
			--v[i].ff.ff; v[i].ff.ss += 20 * (q[1] - '0') * 60;
			v[i].ff.ss += (q[4] - '0') * 3600 + 10 * (q[6] - '0') * 60 + (q[7] - '0') * 60;
			v[i].ff.ss += (q[8] - '0') * 10 + (q[9] - '0');
				
		}
		if(v[i].ss.s == "NijeZivotJedanACM"){
			pos = i;
		}
	}

	v[pos].ff.ff = v[pos].ff.ss = 0;
	for(int i = 0; i < m; i++){
		string q; cin >> q >> q;
		if(q[0] == '-'){
			if(q.size() > 1){
				v[pos].ff.ss += 20 * 60 * (q[1] - '0');
			}
			continue;
		}
		--v[pos].ff.ff; v[pos].ff.ss += 20 * (q[1] - '0') * 60;
		v[pos].ff.ss += (q[4] - '0') * 3600 + 10 * (q[6] - '0') * 60 + (q[7] - '0') * 60;
		v[pos].ff.ss += (q[8] - '0') * 10 + (q[9] - '0');
	}

	sort(v.begin(),v.end());
	for(int i = 0; i < n; i++){
		if(v[i].ss.s == "NijeZivotJedanACM"){
			cout << i + 1 << endl;
		}	
	}
}
 
signed main(){ 

	ios::sync_with_stdio(0);
	cin.tie(0);
 
	int t = 1;
//	cin >> t;
 
	while(t--)
		solve();
 	
	return 0;
}

Compilation message

acm.cpp: In function 'void solve()':
acm.cpp:50:22: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   50 |  v[pos].ff.ff = v[pos].ff.ss = 0;
      |                      ^

Subtask #1

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	212 KB	Output isn't correct
2	Incorrect	2 ms	460 KB	Output isn't correct
3	Incorrect	1 ms	212 KB	Output isn't correct
4	Incorrect	2 ms	468 KB	Output isn't correct
5	Incorrect	2 ms	556 KB	Output isn't correct