Submission #933637

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
933637	2024-02-26T03:29:08 Z	Neytrino	Poi (IOI09_poi)	C++14	0 / 100	187 ms	16216 KB

poi

	/**
	*    author:    inastranets
	*    created:   26.02.2024 06:14:03		
	**/
	#include <bits/stdc++.h>

	using namespace std;

	//#if !defined(ONLINE_JUDGE)
	//#include "debug.hpp"
	//#endif

	const int UNDEF = -1;

	class contestant {
	public:
		int score;
		int solved;
		int ID;
		//contestant(int _score, int _solved, int _ID) : score(_score), solved(_solved), ID(_ID) {} 
	};

	int main() {
		ios_base::sync_with_stdio(false);
		cin.tie(0);

		int n, t, p;

		cin >> n >> t >> p;

		vector<contestant> a(n);
		vector<int> point_of_tasks(t);
		vector<vector<int> > solved(n, vector<int>(t, 0));

		for (int i = 0; i < n; ++ i) {
			for (int j = 0; j < t; ++ j) {
				cin >> solved[i][j];
				point_of_tasks[j] += (solved[i][j] == 0);			
			}
		}

		for (int i = 0; i < n; ++ i) {
			a[i].ID = i + 1;
			for (int j = 0; j < t; ++ j) {
				if (solved[i][j]) {
					++ a[i].solved;
					a[i].score += point_of_tasks[j];
				}
			}
		}

		sort(a.begin(), a.end(), [](const contestant& a, const contestant& b) {
			if (a.score == b.score) {
				if (a.solved == b.solved) {
					return a.ID < b.ID;
				} else {
					return a.solved < b.solved;
				}	
			} else {
				return a.score < b.score;
			}
		});

		for (int i = 0; i < n; ++ i) {
			if (a[i].ID == p) {
				cout << a[i].score << ' ' << i + 1;
				break;
			}
		}

		return 0;
	}	

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Incorrect	0 ms	348 KB	Output isn't correct
4	Incorrect	0 ms	348 KB	Output isn't correct
5	Incorrect	0 ms	348 KB	Output isn't correct
6	Incorrect	0 ms	348 KB	Output isn't correct
7	Incorrect	1 ms	348 KB	Output isn't correct
8	Incorrect	1 ms	348 KB	Output isn't correct
9	Incorrect	1 ms	348 KB	Output isn't correct
10	Incorrect	2 ms	348 KB	Output isn't correct
11	Incorrect	6 ms	860 KB	Output isn't correct
12	Incorrect	10 ms	1268 KB	Output isn't correct
13	Incorrect	28 ms	2652 KB	Output isn't correct
14	Incorrect	45 ms	3888 KB	Output isn't correct
15	Incorrect	70 ms	6236 KB	Output isn't correct
16	Incorrect	75 ms	6744 KB	Output isn't correct
17	Incorrect	115 ms	9820 KB	Output isn't correct
18	Incorrect	126 ms	11100 KB	Output isn't correct
19	Incorrect	168 ms	14640 KB	Output isn't correct
20	Incorrect	187 ms	16216 KB	Output isn't correct