TLE求优化
  • 板块P2692 覆盖
  • 楼主Zjc20120331
  • 当前回复0
  • 已保存回复0
  • 发布时间2023/8/25 17:29
  • 上次更新2023/11/3 01:15:36
查看原帖
TLE求优化
654928
Zjc20120331楼主2023/8/25 17:29

rt

#include <bits/stdc++.h>
using namespace std;

bool bm[5010], gm[5010];//打扫过的行、列

int main(){
    int n, m, b, g;
    cin >> n >> m >> b >> g;
    for (int i = 1; i <= b; i++){
        int l, r;
        cin >> l >> r;
        for (int j = l; j <= r; i++){
            bm[j] = 1;
        }
    }
    for (int i = 1; i <= g; i++){
        int l, r;
        cin >> l >> r;
        for (int j = l; j <= r; i++){
            gm[j] = 1;
        }
    }
    int s1 = 0, s2 = 0;//计数器
    for (int i = 1; i <= n; i++){
        if (bm[i] == 1){
            s1++;
        }
    }
    for (int i = 1; i <= m; i++){
        if (gm[i] == 1){
            s2++;
        }
    }
    cout << s1*s2;
    return 0;
}
2023/8/25 17:29
加载中...