Submission #599658

#	Time	Username	Problem	Language	Result	Execution time	Memory
599658		MohamedFaresNebili	통행료 (IOI18_highway)	C++14	0 / 100	15 ms	536 KiB

highway

#include <bits/stdc++.h>
#include "highway.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
 
                using namespace std;
 
                using ll = long long;
                using ld = long double;
                using ii = pair<ll, ll>;
                using vi = vector<int>;
 
                #define ff first
                #define ss second
                #define pb push_back
                #define all(x) (x).begin(), (x).end()
                #define lb lower_bound
 
                const int MOD = 1e9 + 7;
 
                void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
                    int M = U.size(); vector<int> W(M, 0);
                    int K = ask(W); int S = 0; 
                    while(S < M) {
                        vector<int> ar(M, 0); 
                      	for(int l = 0; l <= S; l++) ar[l] = 1;
                      	int E = ask(ar); ///W[S] = 0;
                        if(E == K) S++;
                        else break;
                    }
                    answer(S, S + K / A);
                }

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 6
• Subtask 4: 0 / 33
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31