oj.uz

답안 #586116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
586116 2022-06-30T00:56:15 Z tamthegod Team Contest (JOI22_team) C++14
0 / 100
 0 ms 340 KB 
#include<bits/stdc++.h>

#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n;
int f[maxN];
struct Tpart
{
    int x, y, z;
} a[maxN];
void ReadInput()
{
    cin >> n;
    for(int i=1; i<=n; i++)
        cin >> a[i].x >> a[i].y >> a[i].z;
}
void Solve()
{
    int res = -1;
    for(int i=1; i<=n; i++)
    {
        vector<Tpart> vc;
        for(int j=1; j<=n; j++)
            if(a[j].x < a[i].x)
                vc.emplace_back(a[j]);
        sort(vc.begin(), vc.end(), [](Tpart p, Tpart q)
        {
            return p.y > q.y;
        });
        f[vc.size()] = 0;
        for(int j=(int)vc.size()-1; j>=0; j--)
            f[j] = max(f[j - 1], a[j].z);
        vector<int> c;
        for(Tpart v : vc)
            c.pb(v.z);
        for(int j=0; j<vc.size(); j++)
        {
            int t = upper_bound(c.begin(), c.end(), a[j].z) - c.begin();
            if(t < vc.size()) res = max(res, a[i].x + a[j].y + f[t]);
        }
    }
    cout << res;
}
int32_t main()
{
  //  freopen("x.inp", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ReadInput();
    Solve();
}

Compilation message

team.cpp: In function 'void Solve()':
team.cpp:46:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<Tpart>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for(int j=0; j<vc.size(); j++)
      |                      ~^~~~~~~~~~
team.cpp:49:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<Tpart>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             if(t < vc.size()) res = max(res, a[i].x + a[j].y + f[t]);
      |                ~~^~~~~~~~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -