KOREATECH 1003: 0을 만들자 - Small

Link : judge.koreatech.ac.kr/problem.php?id=1003

---

Python

from sys import stdin
 
data_length = int(stdin.readline().strip())
 
data_arr = [int(data) for data in stdin.readline().strip().split(' ')]
data_arr.sort()
 
counter = 0
save_result = dict()
for idx, target in enumerate(data_arr[0:-1]):
    target *= -1
    s = idx + 1
    e = len(data_arr) - 1
    while e - s >= 1:
        result = data_arr[s] + data_arr[e]
        if result == target:
            try:
                save_result[data_arr[s], data_arr[e], result * -1]
 
            except KeyError:
                counter += 1
                save_result[data_arr[s], data_arr[e], result * -1] = 1
            finally:
                e-=1
        elif result > target:
            e-=1
        elif result < target:
            s+=1
 
        if data_arr[s] > target:
            break
print(counter)

FeedBack

1. 중복제거 하는 법을 잘 모름.
2. set을 이용하여 중복제거 가능 할 듯.

---

C++

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
 
class Type {
public:
    int a, b, c;
    Type(int a, int b, int c) {
        this->a = a;
        this->b = b;
        this->c = c;
    }
};
 
class ResultList {
private:
    vector<Type> list;
public:
    void append(int a, int b, int c) {
        list.push_back(Type(a, b, c));
    }
 
    bool Check(int a,int b,int c) {
        if (list.size() == 0)
            return false;
 
        for (const auto& item : list) {
            if (item.a == a && item.b == b && item.c == c) {
                return true;
            }
        }
        return false;
    }
};
 
int main() {
    int quest_count;
    vector<int> v;
    ResultList save_result;
    cin >> quest_count;
    for (int i = 0; i < quest_count; i++) {
        int input;
        cin >> input;
        v.push_back(input);
    }
    sort(v.begin(), v.end());
 
    int counter = 0;
 
    for (int index = 0; index < v.size() - 1; index++) {
        int target = v[index] * -1;
        int s = index + 1;
        int e = v.size() - 1;
        while(e - s >= 1){
            int result = v[s] + v[e];
            if (result == target) {
                if (!save_result.Check(v[s], v[e], result * -1)) {
                    counter += 1;
                    save_result.append(v[s], v[e], result * -1);
                }
                e -= 1;
            }
            else if (result > target) {
                e -= 1;
            }
            else if (result < target) {
                s += 1;
            }
 
            if (v[s] > target) {
                break;
            }
        }
    }
    cout << counter;
    return 0;
}

FeedBack

1. 중복제거 하는 법을 잘 모름.

 

---

 

 

 

 

cjw.git@gmail.com