oj.uz

Submission #770263

# Submission time Handle Problem Language Result Execution time Memory
770263 2023-07-01T04:08:48 Z Amylopectin Team Contest (JOI22_team) C++14
0 / 100
 1 ms 340 KB 
#include <stdio.h>
#include <iostream>
#include <algorithm>

using namespace std;
// const int mxn = 1e6 + 10;
const int mxn = 30;
struct we
{
    int val,idx;
};
bool cmp(const struct we &l,const struct we &r)
{
    return l.val > r.val;
}
struct we ta[3][mxn],yy[mxn],zz[mxn];
int u[mxn] = {},atc[mxn] = {};
int main()
{
    int i,j,n,m,cn,cx,cy,cz,ncc[3] = {},of,ru[3] = {},ans = 0;
    scanf("%d",&n);
    for(i=0; i<n; i++)
    {
        scanf("%d %d %d",&cx,&cy,&cz);
        ta[0][i] = {cx,i};
        ta[1][i] = {cy,i};
        ta[2][i] = {cz,i};
    }
    for(i=0 ;i<3; i++)
        sort(ta[i],ta[i]+n,cmp);
    // sort(yy,yy+n,cmp);
    // sort(zz,zz+n,cmp);
    while(1)
    {
        of = 0;
        for(i=0; i<3; i++)
        {
            if(ncc[i] == 0)
            {
                for(j=ru[i]; ta[i][j].val== ta[i][ru[i]].val && j < n; j++)
                {
                    cn = ta[i][j].idx;
                    if(u[cn] == 0)
                    {
                        u[cn] = 1;
                        atc[cn] = i;
                        ncc[i] ++;
                    }
                    else if(u[cn] == 1)
                    {
                        u[cn] = 2;
                        ncc[atc[cn]] --;
                    }
                }
                ru[i] = j;
                if(j == n)
                {
                    ans = -1;
                    break;
                }
                of = 1;
                break;
            }
        }
        if(ans == -1)
        {
            break;
        }
        if(of == 0)
        {
            ans = 0;
            for(i=0; i<3; i++)
            {
                ans += ta[i][ru[i]-1].val;
            }
            break;
        }
    }
    printf("%d\n",ans);
    return 0;
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:20:15: warning: unused variable 'm' [-Wunused-variable]
   20 |     int i,j,n,m,cn,cx,cy,cz,ncc[3] = {},of,ru[3] = {},ans = 0;
      |               ^
team.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
team.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         scanf("%d %d %d",&cx,&cy,&cz);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 224 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Incorrect 1 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 224 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Incorrect 1 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory 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 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Runtime error 1 ms 340 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory 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 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Runtime error 1 ms 340 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory 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 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Runtime error 1 ms 340 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory 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 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Runtime error 1 ms 340 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 224 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Incorrect 1 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -