Submission #800027

#	Time	Username	Problem	Language	Result	Execution time	Memory
800027		lollipop	Carnival Tickets (IOI20_tickets)	C++17	27 / 100	439 ms	51356 KiB

tickets

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define s second
#define f first
#define pf push_front
#define inf 100000000000000000
#define bitebi __builtin_popcountll
#define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
#define YES cout <<"YES\n"
#define NO cout << "NO\n"
#define debug cout << "Here Fine" << endl ;
#define pr pair < int , int >
#define fbo find_by_order // returns iterator
#define ook order_of_key // returns strictly less numbers than key
using namespace std ;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const double Pi=acos(-1.0);
const double EPS=1E-8;
const int mod =  1000000007 ;
const int mod1 = 998244353 ;
const int NN = 2e5 + 10 ;
mt19937 R(time(0));
map < int , int > ma , ma1 ;

#include "tickets.h"


// static int n;
// static int m;
// static int k;
// static std::vector<std::vector<int>> d;
// static std::vector<std::vector<int>> x;
// static int called = 0;

// static void check(bool cond, std::string message) {
//     if (!cond) {
//         printf("WA\n");
//         printf("%s\n", message.c_str());
//         exit(0);
//     }
// }


// void allocate_tickets( std::vector<std::vector<int>> _d) {
//     check(!called, "allocate_tickets called more than once");
//     d = _d;
//     check((int)d.size() == n, "allocate_tickets called with parameter of wrong size");
//     for (int i = 0; i < n; i++) {
//         check((int)d[i].size() == m, "allocate_tickets called with parameter of wrong size");
//     }
//     called = 1;
// }


long long find_maximum(int k, std::vector<std::vector<int>> d){
     vector<std::vector<int>> pas ;
     if( k == 1 && d[ 0 ].size() == 1 ){
     FOR( i , d.size() ){
        vector < int > pas1 ;
        FOR( j , d[ i ].size() ) pas1.pb( 0 ) ;
        pas.pb( pas1 ) ;
     }
     ll ans = 0 ;
     vector < int > v ;
     for( auto x : d ) v.pb( x[ 0 ] ) ;
     sort( v.begin() , v.end() ) ; 
     for( int j = 0 ; j < v.size() / 2 ; j ++ ) ans = ans + v[ v.size() - j - 1 ] - v[ j ] ;

      allocate_tickets( pas ) ;
      return ans ; }

     // fill with -1 and find the max/min pairs 
     FOR( i , d.size() ){
        vector < int > pas1 ;
        FOR( j , d[ i ].size() ) pas1.pb( -1 ) ;
        pas.pb( pas1 ) ;
     }

     int n = d.size() ;
     int cc = 0 ;
      ll ans = 0 ;
     while( k -- ){
     pair < int , int > p[ n ] ;
       FOR( i , d.size() ){
        vector < pair < int , int > > vv ; 
        FOR( j , d[ i ].size() ){
            if( pas[ i ][ j ] != -1 ) continue ; 
            vv.pb( { d[ i ][ j ] , j } ) ;
        }
       sort( vv.begin() , vv.end() ) ;
       p[ i ].f = vv[ 0 ].s ;
       p[ i ].s = vv[ vv.size() - 1 ].s ;
      }   
     vector < pair < int , int > > cur ;
     FOR( i , n ){
        cur.pb( { d[ i ][ p[ i ].f ] + d[ i ][ p[ i ].s ] , i } ) ; 
     }
     sort( cur.begin() , cur.end() ) ;
     FOR( i , n / 2 ){
        int pos = cur[ i ].s ;
        pas[ pos ][ p[ pos ].f ] = cc ;
        ans -= d[ pos ][ p[ pos ].f ] ;
     }
     for( int i = n / 2 ; i < n ; i ++ ){
        int pos = cur[ i ].s ;
        pas[ pos ][ p[ pos ].s ] = cc ;
        ans += d[ pos ][ p[ pos ].s ] ;       
     }
     cc ++ ; 
    }
    allocate_tickets( pas ) ;
    return ans ;
}



// int main() {
//     assert(scanf("%d %d %d", &n, &m, &k) == 3);
//     x.resize(n);
//     for (int i = 0; i < n; i++) {
//         x[i].resize(m);
//         for (int j=0; j < m; j++) {
//             assert(scanf("%d", &x[i][j]) == 1);
//         }
//     }
//     fclose(stdin);

//     long long answer = find_maximum(k, x);
//     check(called, "failure to call allocate_tickets");
//     printf("OK\n");
//     printf("%lld\n", answer);
//     for (int i = 0; i < n; i++) {
//         for (int j = 0; j < m; j++) {
//             if (j) printf(" ");
//             printf("%d", d[i][j]);
//         }
//         printf("\n");
//     }
//     fclose(stdout);
//     return 0;
// }

Compilation message (stderr)

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:12:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
......
   66 |      FOR( i , d.size() ){
      |           ~~~~~~~~~~~~                   
tickets.cpp:66:6: note: in expansion of macro 'FOR'
   66 |      FOR( i , d.size() ){
      |      ^~~
tickets.cpp:12:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
......
   68 |         FOR( j , d[ i ].size() ) pas1.pb( 0 ) ;
      |              ~~~~~~~~~~~~~~~~~           
tickets.cpp:68:9: note: in expansion of macro 'FOR'
   68 |         FOR( j , d[ i ].size() ) pas1.pb( 0 ) ;
      |         ^~~
tickets.cpp:75:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |      for( int j = 0 ; j < v.size() / 2 ; j ++ ) ans = ans + v[ v.size() - j - 1 ] - v[ j ] ;
      |                       ~~^~~~~~~~~~~~~~
tickets.cpp:12:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
......
   81 |      FOR( i , d.size() ){
      |           ~~~~~~~~~~~~                   
tickets.cpp:81:6: note: in expansion of macro 'FOR'
   81 |      FOR( i , d.size() ){
      |      ^~~
tickets.cpp:12:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
......
   83 |         FOR( j , d[ i ].size() ) pas1.pb( -1 ) ;
      |              ~~~~~~~~~~~~~~~~~           
tickets.cpp:83:9: note: in expansion of macro 'FOR'
   83 |         FOR( j , d[ i ].size() ) pas1.pb( -1 ) ;
      |         ^~~
tickets.cpp:12:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
......
   92 |        FOR( i , d.size() ){
      |             ~~~~~~~~~~~~                 
tickets.cpp:92:8: note: in expansion of macro 'FOR'
   92 |        FOR( i , d.size() ){
      |        ^~~
tickets.cpp:12:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
......
   94 |         FOR( j , d[ i ].size() ){
      |              ~~~~~~~~~~~~~~~~~           
tickets.cpp:94:9: note: in expansion of macro 'FOR'
   94 |         FOR( j , d[ i ].size() ){
      |         ^~~

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10