fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. template<typename X, typename Y>
  5. bool chmax(X& a, Y b) { return (a < b) ? a = b, 1 : 0; }
  6.  
  7. template<typename X, typename Y>
  8. bool chmin(X& a, Y b) { return (a > b) ? a = b, 1 : 0; }
  9.  
  10. using ll = long long;
  11.  
  12. const int MOD = 1e9+7;
  13. const int INV2 = (MOD + 1) / 2;
  14. const int N = 2e5+5;
  15.  
  16. struct Query {
  17.     int type, x, y;
  18. } qs[N];
  19.  
  20. int n, q;
  21. ll a[N];
  22.  
  23. namespace Subtask1 {
  24.     bool check() {
  25.         return n <= 200 && q <= 200;
  26.     }
  27.     void solve() {
  28.         for (int i = 0; i < q; i++) {
  29.             if (qs[i].type == 1) {
  30.                 int k = qs[i].x, x = qs[i].y;
  31.                 a[k] = x;
  32.             } else {
  33.                 int l = qs[i].x, r = qs[i].y;
  34.                 ll ans = 0;
  35.                 for (int i = l; i <= r; i++)
  36.                     for (int j = i + 1; j <= r; j++)
  37.                         ans = (ans + a[i] * a[j] % MOD) % MOD;
  38.                 cout << ans << '\n';
  39.             }
  40.         }
  41.     }
  42. }
  43.  
  44. namespace Subtask2 {
  45.     ll P[N], P2[N];
  46.     bool check() {
  47.         for (int i = 0; i < q; i++)
  48.             if (qs[i].type == 1) return false;
  49.         return true;
  50.     }
  51.     void solve() {
  52.         for (int i = 1; i <= n; i++) {
  53.             P[i] = P[i - 1] + a[i];
  54.             P2[i] = P2[i - 1] + (a[i] * a[i]);
  55.         }
  56.         for (int i = 0; i < q; i++) {
  57.             int l = qs[i].x, r = qs[i].y;
  58.             ll S1 = (P[r] - P[l - 1] + MOD) % MOD, S2 = (P2[r] - P2[l - 1] + MOD) % MOD;
  59.             cout << (S1 * S1 % MOD - S2 + MOD) % MOD * INV2 % MOD << '\n';
  60.         }
  61.     }
  62. }
  63.  
  64. namespace Fulltask {
  65.     void solve() {
  66.  
  67.     }
  68. }
  69.  
  70. void solve() {
  71.     cin >> n >> q;
  72.     for (int i = 1; i <= n; i++) cin >> a[i];
  73.     for (int i = 0; i < q; i++) {
  74.         int type, x, y; cin >> type >> x >> y;
  75.         qs[i] = {type, x, y};
  76.     }
  77.     if (Subtask1::check()) Subtask1::solve();
  78.     else if (Subtask2::check()) Subtask2::solve();
  79.     else Fulltask::solve();
  80. }
  81.  
  82. int main() {
  83.     ios_base::sync_with_stdio(false); cin.tie(NULL);
  84.  
  85.     #define TASK "STSYS"
  86.     if (fopen(TASK".INP", "r")) {
  87.         freopen(TASK".INP", "r", stdin);
  88.         freopen(TASK".OUT", "w", stdout);
  89.     }
  90.  
  91.     int tests = 1; // cin >> tests;
  92.     while (tests--) solve();
  93.  
  94.     #ifdef LOCAL
  95.     cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
  96.     #endif
  97.     return 0;
  98. }
  99.  
Success #stdin #stdout 0.01s 7680KB
comments (?)
stdin
copy 
4 4
2 1 3 5
2 1 2
2 2 4
1 1 5
2 1 3
stdout
copy 
2
23
23
https://ideone.com/waxuiz
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!