| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1006428 | huutuan | Poi (IOI09_poi) | C++14 | 185 ms | 23892 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;
const int N=2010;
int n, t, p, d[N];
vector<int> b[N];
int a[N][N];
int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> t >> p;
   for (int i=1; i<=n; ++i) for (int j=1; j<=t; ++j){
      cin >> a[i][j];
      if (!a[i][j]) ++d[j];
   }
   for (int i=1; i<=n; ++i){
      b[i].push_back(0);
      for (int j=1; j<=t; ++j) b[i][0]+=d[j]*a[i][j];
      b[i].push_back(accumulate(a[i], a[i]+t+1, 0));
      b[i].push_back(-i);
   }
   int ans=1;
   for (int i=1; i<=n; ++i) if (b[i]>b[p]) ++ans;
   cout << b[p][0] << ' ' << ans << '\n';
   return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
