제출 #423718

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423718		ignaciocanta	Poi (IOI09_poi)	C++14	100 / 100	367 ms	15988 KiB

poi

#include <bits/stdc++.h>

using namespace std;

//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//template<class T> using Tree = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
 
using tint = long long;
using ld = long double;
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)	
 
using pi = pair<int,int>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;
 
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert
 
#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7; 
const int mod = 998244353;
const int MX = 2005;
const tint INF = 1e18; 
const int inf = 2e8;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-5;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
template<class T> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} 
template<class T> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
 
bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redondea p abajo
 
void NACHO(string name = ""){
    ios_base::sync_with_stdio(0); cin.tie(0);
    if(sz(name)){
        freopen((name+".in").c_str(), "r", stdin);
        freopen((name+".out").c_str(), "w", stdout);
    }
}

int a[MX][MX];
int quan[MX];

struct Contestant{
	int id, pts, quan;
	bool operator<(const Contestant& o)const{
		if(pts  == o.pts){
			if(quan == o.quan) return id < o.id;
			return quan > o.quan;
		}
		return pts > o.pts;
	}
};

int main(){
	NACHO();
	int n, t, p; cin >> n >> t >> p;
	--p;
	F0R(i, n){
		F0R(j, t){
			cin >> a[i][j];
			if(a[i][j] == 1) ++quan[j];
		}
	}
	vector<Contestant> c (n);
	F0R(i, n){
		int tot = 0;
		int q = 0;
		F0R(j, t){
			if(a[i][j] == 1) tot += n-quan[j], ++q;
		}
		c[i] = {i, tot, q};
	}
	sort(all(c));
	int points, pos;
	F0R(i, n){
		if(c[i].id == p){
			points = c[i].pts;
			pos = i+1;
		}
	}
	cout << points << " " << pos << "\n";
}
/*
5 3 2 
0 0 1 
1 1 0 
1 0 0 
1 1 0 
1 1 0
*/

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

poi.cpp: In function 'void NACHO(std::string)':
poi.cpp:73:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen((name+".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
poi.cpp:74:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         freopen((name+".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
poi.cpp: In function 'int main()':
poi.cpp:119:34: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
  119 |  cout << points << " " << pos << "\n";
      |                                  ^~~~
poi.cpp:119:20: warning: 'points' may be used uninitialized in this function [-Wmaybe-uninitialized]
  119 |  cout << points << " " << pos << "\n";
      |                    ^~~

• Subtask 1: 100 / 100