Submission #1943812
Source Code Expand
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(x,y) (x=min(x,y))
#define chmax(x,y) (x=max(x,y))
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}
#define N 5010
#define M 60
ll h, w, m, n;
ll a[N], b[N], c[N], d[N];
ll g[M][M];
void add(int i, int x){
for(int j = a[i]; j < b[i]; j++)
for(int k = c[i]; k < d[i]; k++)
g[j][k] += x;
}
int main(){
cin>>h>>w>>m>>n;
rep(i, n){
cin>>a[i]>>b[i]>>c[i]>>d[i];
a[i]--; c[i]--;
}
rep(i, n) add(i, 1);
rep(i, n){
add(i, 3);
ll cnt = 0;
rep(j, h) rep(k, w) cnt += g[j][k]%4==0;
if(cnt==m) cout<<i+1<<endl;
add(i, 1);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
E - 儀式 |
User |
Lepton |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1613 Byte |
Status |
AC |
Exec Time |
24 ms |
Memory |
512 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0-sample-01.txt, subtask0-sample-02.txt |
All |
subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt, subtask1-26.txt, subtask1-27.txt, subtask1-28.txt, subtask1-29.txt, subtask1-30.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0-sample-01.txt |
AC |
1 ms |
256 KB |
subtask0-sample-02.txt |
AC |
1 ms |
256 KB |
subtask1-01.txt |
AC |
1 ms |
256 KB |
subtask1-02.txt |
AC |
1 ms |
256 KB |
subtask1-03.txt |
AC |
1 ms |
256 KB |
subtask1-04.txt |
AC |
2 ms |
256 KB |
subtask1-05.txt |
AC |
2 ms |
256 KB |
subtask1-06.txt |
AC |
4 ms |
384 KB |
subtask1-07.txt |
AC |
4 ms |
384 KB |
subtask1-08.txt |
AC |
10 ms |
384 KB |
subtask1-09.txt |
AC |
16 ms |
384 KB |
subtask1-10.txt |
AC |
16 ms |
384 KB |
subtask1-11.txt |
AC |
18 ms |
384 KB |
subtask1-12.txt |
AC |
5 ms |
256 KB |
subtask1-13.txt |
AC |
9 ms |
384 KB |
subtask1-14.txt |
AC |
12 ms |
384 KB |
subtask1-15.txt |
AC |
17 ms |
384 KB |
subtask1-16.txt |
AC |
21 ms |
384 KB |
subtask1-17.txt |
AC |
19 ms |
384 KB |
subtask1-18.txt |
AC |
19 ms |
384 KB |
subtask1-19.txt |
AC |
22 ms |
384 KB |
subtask1-20.txt |
AC |
21 ms |
384 KB |
subtask1-21.txt |
AC |
21 ms |
384 KB |
subtask1-22.txt |
AC |
21 ms |
384 KB |
subtask1-23.txt |
AC |
21 ms |
384 KB |
subtask1-24.txt |
AC |
21 ms |
384 KB |
subtask1-25.txt |
AC |
19 ms |
384 KB |
subtask1-26.txt |
AC |
24 ms |
512 KB |
subtask1-27.txt |
AC |
21 ms |
384 KB |
subtask1-28.txt |
AC |
19 ms |
384 KB |
subtask1-29.txt |
AC |
21 ms |
384 KB |
subtask1-30.txt |
AC |
21 ms |
384 KB |