제출 #404116

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
404116		SavicS	말 (IOI15_horses)	C++14	17 / 100	16 ms	12044 KiB

horses

#include "horses.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
pii niz[maxn];

int init(int N, int X[], int Y[]) {
	n = N;
	ff(i,1,n)niz[i] = {X[i - 1], Y[i - 1]};
	
	int ans = 0;
	int p = 1;
	ff(i,1,n){
		p *= niz[i].fi;
		ans = max(ans, p * niz[i].se);
	}
	
	return ans;
}

int updateX(int pos, int val) {	
	return 0;
}

int updateY(int pos, int val) {
	return 0;
}

//int main()
//{
//    ios::sync_with_stdio(false);
//    cout.tie(nullptr);
//    cin.tie(nullptr);
//
//    return 0;
//}
/**



// probati bojenje sahovski ili slicno

**/

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

horses.cpp: In function 'int updateX(int, int)':
horses.cpp:46:17: warning: unused parameter 'pos' [-Wunused-parameter]
   46 | int updateX(int pos, int val) {
      |             ~~~~^~~
horses.cpp:46:26: warning: unused parameter 'val' [-Wunused-parameter]
   46 | int updateX(int pos, int val) {
      |                      ~~~~^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:50:17: warning: unused parameter 'pos' [-Wunused-parameter]
   50 | int updateY(int pos, int val) {
      |             ~~~~^~~
horses.cpp:50:26: warning: unused parameter 'val' [-Wunused-parameter]
   50 | int updateY(int pos, int val) {
      |                      ~~~~^~~

• Subtask 1: 17 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23