Submission #303194

#TimeUsernameProblemLanguageResultExecution timeMemory
303194VROOM_VARUNCarnival Tickets (IOI20_tickets)C++14
11 / 100
3 ms768 KiB
/* ID: varunra2 LANG: C++ TASK: tickets */ #include <bits/stdc++.h> using namespace std; #include "tickets.h" #ifdef DEBUG #include "lib/debug.h" #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define debug_arr(...) \ cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__) #pragma GCC diagnostic ignored "-Wsign-compare" //#pragma GCC diagnostic ignored "-Wunused-parameter" //#pragma GCC diagnostic ignored "-Wunused-variable" #else #define debug(...) 42 #endif #define EPS 1e-9 #define IN(A, B, C) assert(B <= A && A <= C) #define INF (int)1e9 #define MEM(a, b) memset(a, (b), sizeof(a)) #define MOD 1000000007 #define MP make_pair #define PB push_back #define all(cont) cont.begin(), cont.end() #define rall(cont) cont.end(), cont.begin() #define x first #define y second const double PI = acos(-1.0); typedef long long ll; typedef long double ld; typedef pair<int, int> PII; typedef map<int, int> MPII; typedef multiset<int> MSETI; typedef set<int> SETI; typedef set<string> SETS; typedef vector<int> VI; typedef vector<PII> VII; typedef vector<VI> VVI; typedef vector<string> VS; #define rep(i, a, b) for (int i = a; i < (b); ++i) #define trav(a, x) for (auto& a : x) #define sz(x) (int)(x).size() typedef pair<int, int> pii; typedef vector<int> vi; #pragma GCC diagnostic ignored "-Wsign-compare" // util functions int n, m; // void allocate_tickets(VVI& x) { // for (int i = 0; i < sz(x); i++) { // debug(i, x[i]); // } // } ll find_maximum(int k, VVI x) { n = sz(x); m = sz(x[0]); debug("here"); VVI ret(n, VI(m, -1)); debug("here"); if (m == 1) { ret = x; sort(all(x)); ll sm1, sm2; sm1 = 0; sm2 = 0; for (int i = 0; i < n / 2; i++) { sm1 += x[i][0]; } for (int i = n / 2; i < n; i++) { sm2 += x[i][0]; } trav(x, ret) x = {0}; allocate_tickets(ret); return sm2 - sm1; } debug("here1"); if (k == 1) { // sum of n/2 largest elements // minus sum of n/2 smallest elements ll sm = 0; priority_queue<pair<pair<ll, ll>, ll>> pq; for (int i = 0; i < n; i++) { ll mx, mn; auto it = max_element(all(x[i])); mn = *min_element(all(x[i])); sm -= mn; mx = *it; pq.push(MP(MP(mx + mn, it - x[i].begin()), i)); } for (int times = 0; times < n / 2; times++) { auto u = pq.top(); pq.pop(); sm += u.x.x; debug(u.y, u.x.y); ret[u.y][u.x.y] = 0; } debug("here"); allocate_tickets(ret); return sm; } } // int main() { // #ifndef ONLINE_JUDGE // freopen("tickets.in", "r", stdin); // freopen("tickets.out", "w", stdout); // #endif // cin.sync_with_stdio(0); // cin.tie(0); // int n, m, k; // cin >> n >> m >> k; // VVI vals(n, VI(m)); // for (int i = 0; i < n; i++) { // for (int j = 0; j < m; j++) { // cin >> vals[i][j]; // } // } // auto x = find_maximum(k, vals); // debug(x); // return 0; // }

Compilation message (stderr)

tickets.cpp: In function 'll find_maximum(int, VVI)':
tickets.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
tickets.cpp:68:3: note: in expansion of macro 'debug'
   68 |   debug("here");
      |   ^~~~~
tickets.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
tickets.cpp:72:3: note: in expansion of macro 'debug'
   72 |   debug("here");
      |   ^~~~~
tickets.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
tickets.cpp:90:3: note: in expansion of macro 'debug'
   90 |   debug("here1");
      |   ^~~~~
tickets.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
tickets.cpp:112:7: note: in expansion of macro 'debug'
  112 |       debug(u.y, u.x.y);
      |       ^~~~~
tickets.cpp:20:20: warning: statement has no effect [-Wunused-value]
   20 | #define debug(...) 42
      |                    ^~
tickets.cpp:117:5: note: in expansion of macro 'debug'
  117 |     debug("here");
      |     ^~~~~
tickets.cpp:70:23: warning: control reaches end of non-void function [-Wreturn-type]
   70 |   VVI ret(n, VI(m, -1));
      |                       ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...