Submission #1295662

#TimeUsernameProblemLanguageResultExecution timeMemory
1295662eldaees131313Calvinball championship (CEOI15_teams)C++20
0 / 100
170 ms720 KiB
////////////////////////////// Author:eldaee, coder_viper #pragma GCC optimize ("Ofast") #include <bits/stdc++.h> #define int long long #define str string #define vec vector #define dou double #define ld long double #define pb push_back #define ppb pop_back #define eb emplace_back #define OK cout << "OK" << '\n' #define Ok cout << "Ok" << '\n' #define YES cout << "YES" << '\n' #define Yes cout << "Yes" << '\n' #define NO cout << "NO" << '\n' #define No cout << "No" << '\n' #define gcd __gcd #define all(x) x.begin(),x.end() #define eldaee ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; /* */ const int mod = 1000001; void solve() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } int x = 1; int ma = 1; for (int i = 1; i < n; i++) { for (int j = 1; j < v[i]; j++) { if (j <= ma) { x = (x + 1) % mod; } } if (v[i] > ma) { ma = v[i]; } } cout << x % mod << '\n'; } signed main() { eldaee solve(); }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...