제출 #757978

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
757978		BentoOreo	Fruits (NOI22_fruits)	C++14	0 / 100	53 ms	7704 KiB

Main

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <unordered_map>
#include <deque>
#include <set>
#include <unordered_set>
#include <algorithm>
#define ll long long
using namespace std;
int max_count = 0;
unordered_map<int,pair<ll,ll> > copygarbage;
void recurse(unordered_map<int,pair<ll,ll> > gyms, ll level, int count){
    if(gyms.size() == 0){
        max_count = max(max_count,count);
    } else {
        for(auto elem: gyms){
            if(level <= elem.second.first){//if level less than level cap
                copygarbage = gyms;
                copygarbage.erase(elem.first);
                recurse(copygarbage, level + elem.second.second, count + 1);
            }
        }
        max_count = max(max_count,count);//if I exhaust all I still need to check lol
    }
}
int main(){
    //subtask 1 of problem 2 complete search dfs
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int len;
    cin >> len;
    vector<int> fruits;
    unordered_set <int> stuff;
    vector<int> cost;
    int hold;
    for(int i = 0; i < len; i++){
        cin >> hold;
        stuff.insert(hold);
        fruits.push_back(hold);
    }

    for(int i = 0; i < len; i++){
        cin >> hold;
        cost.push_back(hold);
    }
    if(stuff.size() == 1 && *stuff.begin() == -1){
        sort(cost.rbegin(),cost.rend());
        int sum = 0;
        char c;
        for(int i = 0; i < cost.size(); i++){
            sum += cost.at(i);
            if(i == cost.size()-1){
                c = '\n';
            } else {
                c = ' ';
            }
            cout << sum << c;
        }
    } else {
        cout << "AHHHHHH" << endl;
    }
}

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

Main.cpp: In function 'int main()':
Main.cpp:54:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for(int i = 0; i < cost.size(); i++){
      |                        ~~^~~~~~~~~~~~~
Main.cpp:56:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |             if(i == cost.size()-1){
      |                ~~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 6
• Subtask 2: 0 / 5
• Subtask 3: 0 / 11
• Subtask 4: 0 / 13
• Subtask 5: 0 / 23
• Subtask 6: 0 / 42