# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
778304 | raysh07 | Poi (IOI09_poi) | C++17 | 195 ms | 31888 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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] == 1) 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])) 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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |