結果

問題 No.1338 Giant Class
ユーザー semisagi
提出日時 2021-01-15 22:19:34
言語 Swift
(6.0.3)
結果
AC  
実行時間 289 ms / 2,000 ms
コード長 3,391 bytes
コンパイル時間 3,591 ms
コンパイル使用メモリ 185,420 KB
実行使用メモリ 21,944 KB
最終ジャッジ日時 2024-11-26 15:55:55
合計ジャッジ時間 7,429 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import Foundation
struct Scanner {
private var elements = [String]()
private var index = 0
mutating func peek() -> String {
while elements.count == index {
elements = readLine()!.split(separator: " ").map(String.init)
index = 0
}
return elements[index]
}
mutating func next() -> String {
defer { index += 1 }
return peek()
}
mutating func nextInt() -> Int {
return Int(next())!
}
mutating func nextInts(_ n: Int) -> [Int] {
return (0 ..< n).map { _ in nextInt() }
}
mutating func nextDouble() -> Double {
return Double(next())!
}
}
let mod = 1000000007
struct Zn: CustomStringConvertible, AdditiveArithmetic {
let n: Int
init(_ n: Int) {
self.n = n
}
var description: String {
String(self.n)
}
static var zero = Zn(0)
static var one = Zn(1)
static func + (lhs: Self, rhs: Self) -> Self {
let n = lhs.n + rhs.n
return Zn(n < mod ? n : n - mod)
}
static func + (lhs: Self, rhs: Int) -> Self {
return lhs + Zn(rhs)
}
static func + (lhs: Int, rhs: Self) -> Self {
return Zn(lhs) + rhs
}
static func - (lhs: Self, rhs: Self) -> Self {
let n = lhs.n - rhs.n
return Zn(n >= 0 ? n : n + mod)
}
static func - (lhs: Self, rhs: Int) -> Self {
return lhs - Zn(rhs)
}
static func - (lhs: Int, rhs: Self) -> Self {
return Zn(lhs) - rhs
}
static func * (lhs: Self, rhs: Self) -> Self {
Zn((lhs.n * rhs.n) % mod)
}
static func * (lhs: Self, rhs: Int) -> Self {
return lhs * Zn(rhs)
}
static func * (lhs: Int, rhs: Self) -> Self {
return Zn(lhs) * rhs
}
static func / (lhs: Zn, rhs: Zn) -> Self {
return lhs * rhs.inverse
}
static func / (lhs: Int, rhs: Zn) -> Self {
return Zn(lhs) * rhs.inverse
}
static func / (lhs: Zn, rhs: Int) -> Self {
return lhs * Zn(rhs).inverse
}
static func += (lhs: inout Self, rhs: Self) {
lhs = lhs + rhs
}
static func += (lhs: inout Self, rhs: Int) {
lhs = lhs + Zn(rhs)
}
static func -= (lhs: inout Self, rhs: Self) {
lhs = lhs - rhs
}
static func -= (lhs: inout Self, rhs: Int) {
lhs = lhs - Zn(rhs)
}
static func *= (lhs: inout Self, rhs: Self) {
lhs = lhs * rhs
}
static func *= (lhs: inout Self, rhs: Int) {
lhs = lhs * Zn(rhs)
}
static func /= (lhs: inout Self, rhs: Self) {
lhs = lhs / rhs
}
static func /= (lhs: inout Self, rhs: Int) {
lhs = lhs / Zn(rhs)
}
func pow(_ n: Int) -> Self {
if n == 0 {
return Zn(1)
} else if n % 2 == 1 {
return self * self.pow(n - 1)
} else {
return (self * self).pow(n / 2)
}
}
var inverse: Self {
self.pow(mod - 2)
}
}
var scanner = Scanner()
let H = scanner.nextInt()
let W = scanner.nextInt()
let Q = scanner.nextInt()
var smallest = [Int: Int]()
var answer = H * W
for _ in 0 ..< Q {
let y = scanner.nextInt()
let x = scanner.nextInt()
if y < smallest[x, default: H + 1] {
answer -= smallest[x, default: H + 1] - y
smallest[x] = y
}
print(answer)
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0