제출 #693236

#제출 시각아이디문제언어결과실행 시간메모리
693236true22Visiting Singapore (NOI20_visitingsingapore)C++14
4 / 100
1 ms340 KiB
#include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef long double ld; typedef pair<ll, ll> pl; typedef vector<ll> vl; typedef vector<pl> vp; #define nl "\n" #define fr first #define sc second #define pb push_back #define all(x) x.begin(), x.end() #define fur(i, a, b) for(ll i = a; i <= b; ++i) #define ruf(i, a, b) for(ll i = a; i >= b; --i) #define pv(x) for(auto k : x){cout << k << " ";} cout << nl ll K, n, m, A, B; vl v, s, t; void solve(){ // k = 1, m <= n cout << (m * v[1]) << nl; } int main(){ ios::sync_with_stdio(0); cin.tie(0); cin >> K >> n >> m >> A >> B; v.resize(K + 1); s.resize(n + 1); t.resize(m + 1); fur(i, 1, K) cin >> v[i]; fur(i, 1, n) cin >> s[i]; fur(i, 1, m) cin >> t[i]; solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...