QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#409878	#6776. Garden	ksu_^#	6	96ms	3900kb	C++23	3.3kb	2024-05-12 20:33:51	2024-05-12 20:33:51

Judging History

你现在查看的是最新测评结果

[2024-05-12 20:33:51]
评测

测评结果：6
用时：96ms
内存：3900kb

查看

[2024-05-12 20:33:51]
提交

answer

#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>

using namespace std;
typedef long long ll;

int main(){
    ll n, m, d;
    cin >> n >> m >> d;
    
    vector<pair<ll, ll>> a(n), b(m);
    for(auto &i: a)
        cin >> i.first >> i.second;
    
    for(auto &i: b)
        cin >> i.first >> i.second;
    
    ll ans = d * d;
    for(int a0 = 1; a0 <= d; a0++){
        for(int b0 = 1; b0 <= d; b0++){
            if(a0 * b0 >= ans)
                continue;
            
            bool end0 = false;
            
            for(int i = 0; i < d && !end0; i++){
                for(int j = 0; j < d; j++){
                    bool ok = false;
                    
                    for(auto p: b){
                        if(j % d <= (j + b0 - 1) % d){
                            if(j % d <= p.first && p.first <= (j + b0 - 1) % d)
                                continue;
                        }
                        else{
                            if(p.first >= j % d || p.first <= (j + b0 - 1) % d)
                                continue;
                        }
                        
                        if(i % d <= (i + a0 - 1) % d){
                            if(i % d <= p.second && p.second <= (i + a0 - 1) % d)
                                continue;
                        }
                        else{
                            if(p.second >= i % d || p.second <= (i + a0 - 1) % d)
                                continue;
                        }
                        
                        ok = true;
                        break;
                    }
                    for(auto p: a){
                        bool flag1 = false, flag2 = false;
                        if(j % d <= (j + b0 - 1) % d){
                            if(j % d <= p.first && p.first <= (j + b0 - 1) % d)
                                flag1 = true;
                        }
                        else{
                            if(p.first >= j % d || p.first <= (j + b0 - 1) % d)
                                flag1 = true;
                        }
                        
                        if(i % d <= (i + a0 - 1) % d){
                            if(i % d <= p.second && p.second <= (i + a0 - 1) % d)
                                flag2 = true;
                        }
                        else{
                            if(p.second >= i % d || p.second <= (i + a0 - 1) % d)
                                flag2 = true;
                        }
                        
                        if(!flag1 || !flag2){
                            ok = true;
                            break;
                        }
                    }
                    
                    if(!ok){
                        ans = a0 * b0;
                        end0 = true;
                        break;
                    }
                }
            }
        }
    }
    
    cout << ans << endl;
    
    return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0

Time Limit Exceeded

Test #1:

score: 0

Time Limit Exceeded

input:

499986 5 1979
299 1572
1897 274
119 291
206 1287
816 937
1922 1376
1676 57
1106 1706
1534 176
678 606
722 473
399 727
1682 1736
221 506
1413 1857
523 1730
1699 346
1056 1287
801 1017
314 1938
1872 189
1750 581
1846 1937
37 1840
1760 725
1465 1222
678 1203
1422 1930
1273 195
730 1930
232 1666
860 352...

output:

result:

Subtask #2:

score: 6

Accepted

Test #11:

score: 6

Accepted

time: 0ms

memory: 3668kb

input:

output:

result:

ok single line: '12'

Test #12:

score: 0

Accepted

time: 3ms

memory: 3900kb

input:

1759 3239 7
5 5
2 5
3 5
3 5
2 5
1 5
3 5
4 5
5 5
1 5
3 5
5 5
2 5
5 5
5 5
2 5
4 5
1 5
1 5
4 5
2 5
3 5
1 5
4 5
5 5
1 5
2 5
1 5
1 5
3 5
4 5
2 5
1 5
2 5
5 5
2 5
2 5
4 5
3 5
2 5
4 5
5 5
5 5
2 5
3 5
4 5
1 5
2 5
4 5
3 5
3 5
3 5
4 5
5 5
3 5
3 5
1 5
5 5
1 5
3 5
1 5
5 5
4 5
3 5
5 5
3 5
4 5
2 5
5 5
2 5
2 5
2 5
...

output:

result:

ok single line: '5'

Test #13:

score: 0

Accepted

time: 2ms

memory: 3692kb

input:

output:

result:

ok single line: '10'

Test #14:

score: 0

Accepted

time: 0ms

memory: 3636kb

input:

output:

result:

ok single line: '10'

Test #15:

score: 0

Accepted

time: 3ms

memory: 3636kb

input:

output:

result:

ok single line: '9'

Test #16:

score: 0

Accepted

time: 31ms

memory: 3876kb

input:

output:

result:

ok single line: '40'

Test #17:

score: 0

Accepted

time: 59ms

memory: 3612kb

input:

output:

result:

ok single line: '70'

Test #18:

score: 0

Accepted

time: 73ms

memory: 3896kb

input:

output:

result:

ok single line: '56'

Test #19:

score: 0

Accepted

time: 96ms

memory: 3636kb

input:

output:

result:

ok single line: '100'

Test #20:

score: 0

Accepted

time: 0ms

memory: 3640kb

input:

output:

result:

ok single line: '1'

Test #21:

score: 0

Accepted

time: 1ms

memory: 3640kb

input:

output:

result:

ok single line: '2'

Subtask #3:

score: 0

Time Limit Exceeded

Dependency #2:

100%

Accepted

Test #22:

score: 0

Time Limit Exceeded

input:

2098 2896 47
18 20
23 28
6 4
5 4
29 4
21 20
24 17
7 20
21 37
7 37
44 44
23 44
18 37
7 4
4 4
5 26
29 37
16 28
14 20
38 44
29 44
24 17
24 37
21 11
29 11
5 20
5 44
23 26
2 32
7 4
14 4
6 33
7 20
2 44
3 17
16 17
20 4
14 17
16 4
44 17
3 44
16 33
7 11
4 32
18 44
3 44
21 33
23 17
2 26
18 20
4 23
16 44
16 11...

output:

result:

Subtask #4:

score: 0

Skipped

Dependency #3:

Subtask #5:

score: 0

Skipped

Dependency #4:

Subtask #6:

score: 0

Skipped

QOJ.ac

QOJ

Judging History

answer

Details

Subtask #1:

Test #1:

input:

output:

result:

Subtask #2:

Test #11:

input:

output:

result:

Test #12:

input:

output:

result:

Test #13:

input:

output:

result:

Test #14:

input:

output:

result:

Test #15:

input:

output:

result:

Test #16:

input:

output:

result:

Test #17:

input:

output:

result:

Test #18:

input:

output:

result:

Test #19:

input:

output:

result:

Test #20:

input:

output:

result:

Test #21:

input:

output:

result:

Subtask #3:

Dependency #2:

Test #22:

input:

output:

result:

Subtask #4:

Dependency #3:

Subtask #5:

Dependency #4:

Subtask #6:

Dependency #1: