제출 #937954

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
937954		guymmk	Poi (IOI09_poi)	C++14	5 / 100	189 ms	8744 KiB

poi

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define endl "\n"
#define vi vector<int>
#define vpii vector<pair<int,int> >
#define umap unordered_map
#define uset unordered_set
#define mk make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define read(x) for (auto& zu: (x)) cin >> zu;
#define F first
#define S second
#define mustawa ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define pii pair<int,int>
#define mishari main
const int inf=1e9+7;
void fa(bool ok){ cout << (ok ? "YES": "NO") << "\n";}
void usaco(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
void solve(){
    int n,t,p;
    cin>>n>>t>>p;
    vpii v(n);
    vector<int>points(n);
    bool solved[n][t]={};
    for(int i=0;i<n;i++){
        for(int j=0;j<t;j++){
            int x;
            cin>>x;
            solved[i][j]=x;
            points[j]+=!x;
        }
    }for(int i=0;i<n;i++){
        v[i].S=i+1;
        for(int j=0;j<t;j++){
            if(solved[i][j]){
                v[i].F+=points[j];
            }
        }
    }sort(all(v));
    for(int i=0;i<n;i++){
        if(v[i].S==p){
            cout<<v[i].F<<" "<<i+1<<endl;
        }
    }
}signed mishari(){
    mustawa;
    int t=1;
    //usaco("")
    //cin>>t;
    while(t--)solve();
}

컴파일 시 표준 에러 (stderr) 메시지

poi.cpp: In function 'void usaco(std::string)':
poi.cpp:22:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
poi.cpp:23:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 100