Submission #73216178

Source Code Expand

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_CYAN = "\033[1;36m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


int main() {
    int N, M, K;
    cin >> N >> M >> K;

    vector<int> A(N);
    cin >> A;

    int ret = 0;
    lint sum = 0;
    REP(_, M) {
        int b;
        cin >> b;
        --b;
        if (A.at(b) < K) ++ret, sum += A.at(b);
    }
    cout << ret << ' ' << sum << '\n';
    
}

Submission Info

Submission Time
Task B - Fruit Sorting
User hitonanode
Language C++23 (GCC 15.2.0)
Score 266
Code Size 6877 Byte
Status AC
Exec Time 18 ms
Memory 4308 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 266 / 266
Status
AC × 3
AC × 71
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3436 KiB
in02.txt AC 1 ms 3428 KiB
in03.txt AC 1 ms 3428 KiB
in04.txt AC 1 ms 3648 KiB
in05.txt AC 1 ms 3676 KiB
in06.txt AC 1 ms 3628 KiB
in07.txt AC 1 ms 3436 KiB
in08.txt AC 1 ms 3628 KiB
in09.txt AC 1 ms 3516 KiB
in10.txt AC 18 ms 4184 KiB
in11.txt AC 16 ms 4308 KiB
in12.txt AC 17 ms 4240 KiB
in13.txt AC 10 ms 4244 KiB
in14.txt AC 9 ms 4240 KiB
in15.txt AC 10 ms 4184 KiB
in16.txt AC 13 ms 4300 KiB
in17.txt AC 1 ms 3676 KiB
in18.txt AC 17 ms 4176 KiB
in19.txt AC 18 ms 4132 KiB
in20.txt AC 16 ms 4296 KiB
in21.txt AC 15 ms 4188 KiB
in22.txt AC 15 ms 4244 KiB
in23.txt AC 17 ms 4192 KiB
in24.txt AC 17 ms 4200 KiB
in25.txt AC 17 ms 4244 KiB
in26.txt AC 13 ms 4300 KiB
in27.txt AC 15 ms 4184 KiB
in28.txt AC 14 ms 4188 KiB
in29.txt AC 1 ms 3644 KiB
in30.txt AC 1 ms 3556 KiB
in31.txt AC 1 ms 3436 KiB
in32.txt AC 1 ms 3600 KiB
in33.txt AC 1 ms 3648 KiB
in34.txt AC 1 ms 3600 KiB
in35.txt AC 1 ms 3584 KiB
in36.txt AC 18 ms 4192 KiB
in37.txt AC 15 ms 4244 KiB
in38.txt AC 17 ms 4184 KiB
in39.txt AC 13 ms 4184 KiB
in40.txt AC 6 ms 3696 KiB
in41.txt AC 9 ms 4240 KiB
in42.txt AC 9 ms 4248 KiB
in43.txt AC 18 ms 4296 KiB
in44.txt AC 17 ms 4244 KiB
in45.txt AC 18 ms 4184 KiB
in46.txt AC 17 ms 4188 KiB
in47.txt AC 17 ms 4188 KiB
in48.txt AC 9 ms 4200 KiB
in49.txt AC 11 ms 4240 KiB
in50.txt AC 15 ms 4240 KiB
in51.txt AC 1 ms 3560 KiB
in52.txt AC 1 ms 3576 KiB
in53.txt AC 1 ms 3580 KiB
in54.txt AC 1 ms 3428 KiB
in55.txt AC 1 ms 3600 KiB
in56.txt AC 1 ms 3600 KiB
in57.txt AC 1 ms 3584 KiB
in58.txt AC 1 ms 3528 KiB
in59.txt AC 1 ms 3484 KiB
in60.txt AC 1 ms 3484 KiB
in61.txt AC 1 ms 3556 KiB
in62.txt AC 1 ms 3516 KiB
in63.txt AC 1 ms 3600 KiB
in64.txt AC 1 ms 3580 KiB
in65.txt AC 1 ms 3520 KiB
in66.txt AC 1 ms 3520 KiB
in67.txt AC 1 ms 3636 KiB
in68.txt AC 1 ms 3676 KiB
sample01.txt AC 1 ms 3560 KiB
sample02.txt AC 1 ms 3580 KiB
sample03.txt AC 1 ms 3580 KiB