제출 #575376

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
575376		d4xn	Mountains (IOI17_mountains)	C++17	0 / 100	1 ms	212 KiB

mountains

#pragma GCC optimize ("Ofast")
    #include "mountains.h"
    #include <bits/stdc++.h>
    using namespace std;
     
    #define ld long double
    #define ll long long
     
    const int N = 2002;
     
    ll n, ans;
	vector<pair<ll, ll>> v, taken;      
 
    int maximum_deevs(vector<int> y) {
    	n = y.size();
    	ans = 0;
    	v.resize(n);
      	for(ll i = 0; i < n; i++) {
          v[i] = make_pair(y[i], i);
        }
      	sort(v.begin(), v.end());
      	for(ll i = 0; i < n; i++) {
          bool ok = 1;
          for (ll j = 0; j < taken.size(); j++) {
            // comprobar si se puede coger
          }
          if (ok) taken.push_back(make_pair(v[i].second, v[i].first));
        }
      	ll sz = taken.size();
    	return max(sz, 1ll);
    }

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

mountains.cpp: In function 'int maximum_deevs(std::vector<int>)':
mountains.cpp:24:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |           for (ll j = 0; j < taken.size(); j++) {
      |                          ~~^~~~~~~~~~~~~~

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30