Submission #778309

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
778309	2023-07-10T08:25:54 Z	raysh07	Poi (IOI09_poi)	C++17	100 / 100	186 ms	31656 KB

poi

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve()
{
	int n, p, t; cin >> n >> t >> p;

	vector <int> uns(t + 1, 0);
	vector <vector <int>> a(n + 1, vector<int>(t + 1, 0));
	vector <int> sc(n + 1, 0);
	vector <int> so(n + 1, 0);

	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= t; j++){
			cin >> a[i][j];
			if (a[i][j] == 0) uns[j]++;
		}
	}

	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= t; j++){
			if (a[i][j] == 1) sc[i] += uns[j], so[i]++;
		}
	}

	int rnk = 1;
	for (int i = 1; i <= n; i++){
		if (sc[i] > sc[p] || (sc[i] == sc[p] && so[i] > so[p]) || (sc[i] == sc[p] && so[i] == so[p] && i < p)) rnk++;
	}

	cout << sc[p] << " " << rnk << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
   	
  //  cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	7 ms	1236 KB	Output is correct
12	Correct	10 ms	1876 KB	Output is correct
13	Correct	37 ms	4948 KB	Output is correct
14	Correct	40 ms	6996 KB	Output is correct
15	Correct	70 ms	12136 KB	Output is correct
16	Correct	76 ms	13140 KB	Output is correct
17	Correct	111 ms	19160 KB	Output is correct
18	Correct	152 ms	21728 KB	Output is correct
19	Correct	166 ms	28628 KB	Output is correct
20	Correct	186 ms	31656 KB	Output is correct