oj.uz

답안 #976530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976530 2024-05-06T16:25:08 Z vjudge1 Trol (COCI19_trol) C++17
50 / 50
 1 ms 348 KB 
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;

ll getID(ll n) {
	return (n - 1) % 9 + 1;
}

int main() {
	//JANGAN LUPA PAKAI LONG LONG!
	ll q; cin >> q;
	while (q--) {
		ll arr[11];
		ll sub[11];
		memset(arr, 0, sizeof(arr));
		memset(sub, 0, sizeof(sub));

		ll l, r; cin >> l >> r;

		if (r <= 9) {
			ll ans = 0;
			for (ll i = l; i <= r; i++) {
				ans += i;
			}

			cout << ans << endl;
			continue;
		}

		ll sisa = r % 9;
		arr[1] += 1;
		arr[sisa + 1] -= 1;

		ll tambah = r / 9;
		arr[1] += tambah;

		for (ll i = 2; i <= 9; i++) {
			arr[i] = arr[i] + arr[i - 1];
		}

		ll sumA = 0;

		for (ll i = 1; i <= 9; i++) {
			sumA = sumA+ i * arr[i];
		}

		//sub
		ll r2 = l - 1;
		ll sisa2 = r2 % 9;
		sub[1] += 1;
		sub[sisa2 + 1] -= 1;

		tambah = r2 / 9;
		sub[1] += tambah;

		for (ll i = 2; i <= 9; i++) {
			sub[i] = sub[i] + sub[i - 1];
		}

		ll sumB = 0;

		for (ll i = 1; i <= 9; i++) {
			sumB = sumB + i * sub[i];
		}

		cout << sumA - sumB << endl;
	}
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct