Submission #468824

#TimeUsernameProblemLanguageResultExecution timeMemory
468824Carmel_Ab1Calvinball championship (CEOI15_teams)C++17
10 / 100
64 ms65540 KiB
#include<bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //using namespace __gnu_pbds; using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef vector<vector<int>> vvi; typedef vector<ll> vl; typedef vector<vl> vvl; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef vector<pl> vpl; typedef vector<ld> vld; typedef pair<ld, ld> pld; //typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set; template<typename T> ostream &operator<<(ostream &os, vector<T> &a) { os << "["; for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); } os << "]\n"; return os; } #define all(x) x.begin(),x.end() #define YES out("YES") #define NO out("NO") #define out(x){cout << x << "\n"; return;} #define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL) #define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";} #define pb push_back #define umap unordered_map template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> &p) { os << "" << p.first << " " << p.second << ""; return os; } void usaco(string taskname) { string fin = taskname + ".in"; string fout = taskname + ".out"; const char *FIN = fin.c_str(); const char *FOUT = fout.c_str(); freopen(FIN, "r", stdin); freopen(FOUT, "w", stdout); } template<typename T> void read(vector<T> &v) { int n = v.size(); for (int i = 0; i < n; i++) cin >> v[i]; } template<typename T> vector<T> UNQ(vector<T> a) { vector<T> ans; for (T t:a) if (ans.empty() || t != ans.back()) ans.push_back(t); return ans; } ll ceil(ll a, ll b) { ll ans = a / b; if (a % b)ans++; return ans; } ld log(ld a, ld b) { return log(b) / log(a); } ll power(ll a,ll b,ll m){ if(!b)return 1; ll r=power(a,b/2,m); ll ans=(r*r)%m; if(b%2)ans=(ans*a)%m; return ans; } string to_base(int n, int new_base) { string s; int nn = n; while (nn) { s += to_string(nn % new_base); nn /= new_base; } reverse(all(s)); return s; } ll gcd(ll a, ll b) { if (a < b)swap(a, b); if (b == 0)return a; return gcd(b, a % b); } ll lcm(ll a, ll b) { ll x = (a / gcd(a, b)); return b * x; } vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) { if (mx == 1e18 + 1) mx = n; vl ans(n); for (int i = 0; i < n; i++) ans[i] = (mn + rand() % (mx - mn + 1)); return ans; } string substr(string s, int l, int r) { string ans; for (int i = l; i <= r; i++) ans += s[i]; return ans; } void solve(); int main() { GLHF; int t = 1; //cin >> t; while (t--) solve(); } ll mod=1000007; void solve() { ll n; cin >> n; vl a(n); read(a); vvl C(n+1,vl(n+1)); for(int i=0; i<=n; i++) C[i][0]=C[0][i]=C[i][i]=1; for(int i=1; i<=n; i++) for(int j=1; j<i; j++) C[i][j]=(C[i][j-1]+C[i-1][j])%mod; ll ans=0; ll has=0; for(ll i=0; i<n; i++){ ll left=n-i-1; for(ll j=0; j<=left; j++){ ll cur=(C[left][j]*power(has+j,left-j,mod))%mod; cur=(cur*(a[i]-1))%mod; ans=(ans+cur)%mod; } if(a[i]==has+1) has++; } ans=(ans+1)%mod; out(ans) }

Compilation message (stderr)

teams.cpp: In function 'std::vector<_Tp> UNQ(std::vector<_Tp>)':
teams.cpp:70:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   70 |     for (T t:a)
      |     ^~~
teams.cpp:73:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   73 |         return ans;
      |         ^~~~~~
teams.cpp: In function 'void usaco(std::string)':
teams.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
teams.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
#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...