oj.uz

답안 #856425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856425 2023-10-03T13:13:25 Z Niktop Tug of War (BOI15_tug) C++14
18 / 100
 829 ms 1628 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#pragma GCC optimize ("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize ("-O2")

const int N = 2e6+6;

int32_t main()
{
    int n, k;
    cin >> n >> k;
    int l[n*2], r[n*2], s[2*n];
    for (int i = 0 ;i < 2*n; i++)
        cin >> l[i] >> r[i] >> s[i];
    for (int i = 0; i < (1 << (2*n)); i++)
    {
        int x[2*n];
        int kk = i;
        for (int j = 0; j < 2*n; j++)
            x[j] = kk % 2, kk /= 2;
        set<int> s1,s2;
        int sum1 = 0, sum2 = 0;
        for (int j = 0; j < 2*n; j++)
        {
            if (x[j] == 1)
                s1.insert(l[j]), sum1 += s[j];
            else
                s2.insert(r[j]), sum2 += s[j];
        }
        if (s1.size() == n && s2.size() == n && abs(sum1 - sum2) <= k)
        {
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";

}

Compilation message

tug.cpp: In function 'int32_t main()':
tug.cpp:39:23: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   39 |         if (s1.size() == n && s2.size() == n && abs(sum1 - sum2) <= k)
      |             ~~~~~~~~~~^~~~
tug.cpp:39:41: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   39 |         if (s1.size() == n && s2.size() == n && abs(sum1 - sum2) <= k)
      |                               ~~~~~~~~~~^~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 798 ms 412 KB Output is correct
2 Correct 31 ms 408 KB Output is correct
3 Correct 725 ms 412 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 829 ms 412 KB Output is correct
6 Correct 712 ms 412 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Correct 206 ms 416 KB Output is correct
9 Correct 35 ms 344 KB Output is correct
10 Correct 779 ms 412 KB Output is correct
11 Correct 35 ms 344 KB Output is correct
12 Correct 10 ms 348 KB Output is correct
13 Correct 79 ms 348 KB Output is correct
14 Correct 32 ms 348 KB Output is correct
15 Correct 10 ms 348 KB Output is correct
16 Correct 779 ms 412 KB Output is correct
17 Correct 85 ms 344 KB Output is correct
18 Correct 34 ms 408 KB Output is correct
19 Correct 16 ms 356 KB Output is correct
20 Correct 109 ms 348 KB Output is correct
21 Correct 668 ms 428 KB Output is correct
22 Correct 28 ms 348 KB Output is correct
23 Correct 714 ms 412 KB Output is correct
24 Correct 24 ms 348 KB Output is correct
25 Correct 721 ms 348 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 798 ms 412 KB Output is correct
2 Correct 31 ms 408 KB Output is correct
3 Correct 725 ms 412 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 829 ms 412 KB Output is correct
6 Correct 712 ms 412 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Correct 206 ms 416 KB Output is correct
9 Correct 35 ms 344 KB Output is correct
10 Correct 779 ms 412 KB Output is correct
11 Correct 35 ms 344 KB Output is correct
12 Correct 10 ms 348 KB Output is correct
13 Correct 79 ms 348 KB Output is correct
14 Correct 32 ms 348 KB Output is correct
15 Correct 10 ms 348 KB Output is correct
16 Correct 779 ms 412 KB Output is correct
17 Correct 85 ms 344 KB Output is correct
18 Correct 34 ms 408 KB Output is correct
19 Correct 16 ms 356 KB Output is correct
20 Correct 109 ms 348 KB Output is correct
21 Correct 668 ms 428 KB Output is correct
22 Correct 28 ms 348 KB Output is correct
23 Correct 714 ms 412 KB Output is correct
24 Correct 24 ms 348 KB Output is correct
25 Correct 721 ms 348 KB Output is correct
26 Incorrect 4 ms 600 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 1628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 798 ms 412 KB Output is correct
2 Correct 31 ms 408 KB Output is correct
3 Correct 725 ms 412 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 829 ms 412 KB Output is correct
6 Correct 712 ms 412 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Correct 206 ms 416 KB Output is correct
9 Correct 35 ms 344 KB Output is correct
10 Correct 779 ms 412 KB Output is correct
11 Correct 35 ms 344 KB Output is correct
12 Correct 10 ms 348 KB Output is correct
13 Correct 79 ms 348 KB Output is correct
14 Correct 32 ms 348 KB Output is correct
15 Correct 10 ms 348 KB Output is correct
16 Correct 779 ms 412 KB Output is correct
17 Correct 85 ms 344 KB Output is correct
18 Correct 34 ms 408 KB Output is correct
19 Correct 16 ms 356 KB Output is correct
20 Correct 109 ms 348 KB Output is correct
21 Correct 668 ms 428 KB Output is correct
22 Correct 28 ms 348 KB Output is correct
23 Correct 714 ms 412 KB Output is correct
24 Correct 24 ms 348 KB Output is correct
25 Correct 721 ms 348 KB Output is correct
26 Incorrect 4 ms 600 KB Output isn't correct
27 Halted 0 ms 0 KB -