# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1018140 | Faggi | Poi (IOI09_poi) | C++11 | 192 ms | 8788 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;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long n, t, p, i, j, tasks, punts;
bool a;
cin >> n >> t >> p;
vector<vector<bool>>v(n,vector<bool>(t));
vector<long long>punt(t,n);
vector<pair<long long, pair<long long, long long>>>tabla;
for(i=0; i<n; i++)
{
for(j=0; j<t; j++)
{
cin >> a;
if(a)
{
punt[j]--;
}
v[i][j]=a;
}
}
for(i=0; i<n; i++)
{
punts=0ll;
tasks=0ll;
for(j=0; j<t; j++)
{
if(v[i][j])
{
tasks++;
punts+=punt[j];
}
}
tabla.push_back({punts,{tasks,i}});
}
sort(tabla.begin(),tabla.end());
for(i=0; i<int(tabla.size()); i++)
{
if(tabla[i].second.second==(p-1ll))
{
cout << tabla[i].first << ' ' << (i+1ll) << '\n';
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |