제출 #1220751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1220751		hmms127	Poi (IOI09_poi)	C++20	60 / 100	167 ms	4376 KiB

poi

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <climits>
#include <cfloat>
#include <cctype>
#include <cstdarg>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <bitset>
#include <vector>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <iterator>
#include <string>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <limits>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <array>
#include <forward_list>
#include <random>
#include <regex>
#include <complex>
using namespace std;
#define f1(n) for(int i=0;i<n;i++)
#define e '\n'
#define f2(m,n,q) for(int i=m;i<n;i+=q)
#define f3(n) for(int j=0;j<n;j++)
#define f4(m,n,q) for(int j=m;j<n;j+=q)
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define pb push_back
#define int long long
//f^=1 == if(f==0)f=1 else f=0
typedef long long ll;
int t;
bool cmp(array<int,3> a,array<int,3> b){
    if(a[1]==b[1]){
        if((t-a[2])!=(t-b[2]))return (t-a[2])>(t-b[2]);
        return a[0]<b[0];
    }
    return a[1]>b[1];
}
int32_t main()
{
     speed;
     int tt=1;
     while(tt--){
       int n,p;cin>>n>>t>>p;
       int score[t]={},cnt[n]={};
       bool a[n][t];f1(n)f3(t)cin>>a[i][j],score[j]+=(a[i][j]==0);
       array<int,3>ar[n];
       f1(n){
           int cnt=0,cnt1=0;
           f3(t){
               cnt+=(a[i][j] ? score[j]:0);
               cnt1+=(a[i][j]==1);
           }
           ar[i]={i+1,cnt,cnt1};
       }
       sort(ar,ar+n,cmp);
       f1(n){
           if(ar[i][0]==p){
               cout<<ar[i][1]<<' '<<i+1<<e;
               return 0;
           }
       }
     }
}

• Subtask 1: 60 / 100