oj.uz

Submission #439419

# Submission time Handle Problem Language Result Execution time Memory
439419 2021-06-29T20:25:24 Z Yomapeed Trol (COCI19_trol) C++17
50 / 50
 1 ms 204 KB 
#include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999 
#define pb push_back
#define ff first
#define ss second
 
#define mt make_tuple
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
 
 
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
 
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
int main() {
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    fast;
    ll T = 1, i, j;
    
    cin >> T;
    while (T--) {
        ll l, r;
        cin >> l >> r;
        ll ans = 0;
        for(i = 0; i < 9; i++){
            ll a, b;
            a = i + ((l - i + 8) / 9) * 9;
            b = i + ((r - i) / 9) * 9;
            ll m = i;
            if(i == 0){
                m = 9;
            }
            if(a > b){
                continue;
            }
            if(a > r){
                continue;
            }
            //cout << a << " " << b << endl;
            ans += m * max(0LL, ((b - a) / 9) + 1);
        }
        cout << ans << "\n";
    }
    return 0;
}

Compilation message

trol.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
trol.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
trol.cpp: In function 'int main()':
trol.cpp:29:18: warning: unused variable 'j' [-Wunused-variable]
   29 |     ll T = 1, i, j;
      |                  ^

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct