# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
629905 | chinmoy_101 | Poi (IOI09_poi) | C++14 | 526 ms | 676 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 ll long long
bool cmp(pair<int, pair<int, int>>a, pair<int, pair<int, int>>b)
{
if(a.second.second!=b.second.second)
{
return a.second.second>b.second.second;
}
else
{
if(a.second.first!=b.second.first)
{
return a.second.first>b.second.first;
}
else
{
return a.first<b.first;
}
}
}
int main()
{
int n, t, p;
cin>>n >>t >>p;
vector<int> points_for_each_task_array(t, 0);
vector<vector<int> > arr(n, {0, 0});
vector<pair<int, pair<int, int>> > final_standing(n, {0, {0, 0}});
for(int i=0; i<n; i++)
{
for(int j=0; j<t; j++)
{
cin>>arr[i][j];
if(arr[i][j]==0)
{
points_for_each_task_array[j]++;
}
}
}
for(int i=0; i<n; i++)
{
int ans=0, no_of_problems_solved=0;
for(int j=0; j<t; j++)
{
if(arr[i][j]==1)
{
ans+=points_for_each_task_array[j];
no_of_problems_solved++;
}
}
//id no.ofproblems solved, ans
final_standing[i]={i+1, {no_of_problems_solved, ans} };
}
sort(final_standing.begin(), final_standing.end(), cmp);
for(int i=0; i<n; i++)
{
if(final_standing[i].first==p)
{
cout<<final_standing[i].second.second <<" " <<i+1;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |