제출 #781687

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
781687		YassineBenYounes	Two Currencies (JOI23_currencies)	C++17	0 / 100	42 ms	716 KiB

currencies

#include<bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pair<ll, ll>, null_type, less<pair<ll,ll>>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
////////////////////Only Clear Code//////////////////////////

void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}

void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}

const int mx = 2e3+5;
const int LOG = 25;
const ll inf = 1e18;
const ll mod = 1e8;

vector<pair<int, int>> graph[mx];
vector<int> obstacles[mx];
vector<vector<int>> queries;
vector<int> v;
vector<pair<int, int>> edges;
int nxt = 0;

bool dfs(int node, int p){
    if(node == nxt){
        return 1;
    }
    for(pair<int, int> adj : graph[node]){
        if(adj.first == p)continue;
        for(int x : obstacles[adj.second]){
            v.push_back(x);
        }
        if(dfs(adj.first, node))return 1;
        for(int x : obstacles[adj.second]){
            v.pop_back();
        }
    }
    return 0;
}

void run_case(){
    int n, m, q;cin >> n >> m >> q;
    for(int i = 0; i < n-1;i++){
        int a, b;cin >> a >> b;
        graph[a].push_back({b, i+1});
        graph[b].push_back({a, i+1});
        if(a > b)swap(a, b);
        edges.push_back({a, b});
    }
    for(int i = 0; i < m;i++){
        int a, b;cin >> a >> b;
        obstacles[a].push_back(b);
    }
    for(int i = 0; i < q;i++){
        int a, b, gold, silver;cin >> a >> b >> gold >> silver;
        queries.push_back({a, b, gold, silver});
        v.clear();
        nxt = b;
        dfs(a, a);
        sort(v.begin(), v.end(), greater<int>());
        while(!v.empty() && silver >= v.back()){
            silver -= v.back();
            v.pop_back();
        }
        gold -= v.size();
        gold = max(gold, -1);
        cout << gold << endl;
    }
}

int main(){
    speed;
    int t = 1;
    //cin >> t;
    while(t--){
        run_case();
    }
}

/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

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

currencies.cpp: In function 'bool dfs(int, int)':
currencies.cpp:48:17: warning: unused variable 'x' [-Wunused-variable]
   48 |         for(int x : obstacles[adj.second]){
      |                 ^
currencies.cpp: In function 'void usaco_problem()':
currencies.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:13:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp: In function 'void init()':
currencies.cpp:19:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:21:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 28
• Subtask 3: 0 / 30
• Subtask 4: 0 / 32