제출 #1016086

#제출 시각아이디문제언어결과실행 시간메모리
1016086socpitePoi (IOI09_poi)C++14
5 / 100
403 ms15952 KiB
#include<bits/stdc++.h> using namespace std; const int maxn = 2005; int n, t, p; int A[maxn][maxn], W[maxn], sum[maxn], usum[maxn]; int main() { cin >> n >> t >> p; for(int i = 1; i <= n; i++){ for(int j = 1; j <= t; j++){ cin >> A[i][j]; W[j] += !A[i][j]; } } for(int i = 1; i <= n; i++){ for(int j = 1; j <= t; j++){ sum[i] += W[j]*A[i][j]; usum[i] += A[i][j]; } } int re = 1; for(int i = 1; i <= n; i++){ if(i == p)continue; if(sum[i] > sum[p])re++; else if(sum[i] < sum[p])continue; if(usum[i] > usum[p])re++; else if(usum[i] < usum[p])continue; if(i < p)re++; } cout << sum[p] << " " << re; }
#Verdict Execution timeMemoryGrader output
Fetching results...