Pagini recente » Borderou de evaluare (job #1686167) | Borderou de evaluare (job #2818168) | Borderou de evaluare (job #3160066) | Borderou de evaluare (job #2586393) | Borderou de evaluare (job #2887894)
Borderou de evaluare (job #2887894)
Raport evaluator
Compilare:
main.cpp: In member function 'void prefix_sum::build(std::vector<int>)':
main.cpp:21:667: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
21 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
| ~~^~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 10ms | 8990kb | OK | 10 |
2 | 38ms | 11128kb | OK | 10 |
3 | 823ms | 12894kb | OK | 10 |
4 | 828ms | 13103kb | OK | 10 |
5 | 1503ms | 15237kb | Time limit exceeded | 0 |
6 | 1505ms | 15708kb | Time limit exceeded | 0 |
7 | 1503ms | 16412kb | Time limit exceeded | 0 |
8 | 1507ms | 16420kb | Time limit exceeded | 0 |
9 | 1501ms | 16400kb | Time limit exceeded | 0 |
10 | 1501ms | 16523kb | Time limit exceeded | 0 |
Punctaj total | 40 |