oj.uz

Submission #125384

# Submission time Handle Problem Language Result Execution time Memory
125384 2019-07-05T07:17:52 Z 박상수(#3065) Arranging Tickets (JOI17_arranging_tickets) C++14
10 / 100
 166 ms 504 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_set>
#include <bitset>
#include <time.h>
#include <limits.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define Fi first
#define Se second
#define pb push_back
#define szz(x) (int)x.size()
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
typedef tuple<int, int, int> t3;

int N, M;
int In[100010][3];

int main() {
	scanf("%d%d", &N, &M);
	for(int i=0;i<M;i++) {
		rep(j, 3) scanf("%d", In[i]+j);
	}
	int ans = 1e9;
	rep(b, 1<<M) {
		int T[23] = {};
		rep(i, M) {
			int x = In[i][0], y = In[i][1];
			if(1<<i & b) swap(x, y);
			T[x]++, T[y]--;
			if(x > y) T[0]++;
		}
		for(int i=1;i<N;i++) T[i] += T[i-1];
		int t = *max_element(T, T+N);
		ans = min(ans, t);
	}
	printf("%d\n", ans);
	return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~
arranging_tickets.cpp:38:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   rep(j, 3) scanf("%d", In[i]+j);
             ~~~~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 256 KB Output is correct
2 Correct 153 ms 368 KB Output is correct
3 Correct 153 ms 368 KB Output is correct
4 Correct 166 ms 364 KB Output is correct
5 Correct 150 ms 376 KB Output is correct
6 Correct 152 ms 376 KB Output is correct
7 Correct 151 ms 368 KB Output is correct
8 Correct 149 ms 368 KB Output is correct
9 Correct 152 ms 256 KB Output is correct
10 Correct 151 ms 364 KB Output is correct
11 Correct 151 ms 256 KB Output is correct
12 Correct 149 ms 372 KB Output is correct
13 Correct 151 ms 364 KB Output is correct
14 Correct 153 ms 376 KB Output is correct
15 Correct 150 ms 380 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 256 KB Output is correct
2 Correct 153 ms 368 KB Output is correct
3 Correct 153 ms 368 KB Output is correct
4 Correct 166 ms 364 KB Output is correct
5 Correct 150 ms 376 KB Output is correct
6 Correct 152 ms 376 KB Output is correct
7 Correct 151 ms 368 KB Output is correct
8 Correct 149 ms 368 KB Output is correct
9 Correct 152 ms 256 KB Output is correct
10 Correct 151 ms 364 KB Output is correct
11 Correct 151 ms 256 KB Output is correct
12 Correct 149 ms 372 KB Output is correct
13 Correct 151 ms 364 KB Output is correct
14 Correct 153 ms 376 KB Output is correct
15 Correct 150 ms 380 KB Output is correct
16 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 256 KB Output is correct
2 Correct 153 ms 368 KB Output is correct
3 Correct 153 ms 368 KB Output is correct
4 Correct 166 ms 364 KB Output is correct
5 Correct 150 ms 376 KB Output is correct
6 Correct 152 ms 376 KB Output is correct
7 Correct 151 ms 368 KB Output is correct
8 Correct 149 ms 368 KB Output is correct
9 Correct 152 ms 256 KB Output is correct
10 Correct 151 ms 364 KB Output is correct
11 Correct 151 ms 256 KB Output is correct
12 Correct 149 ms 372 KB Output is correct
13 Correct 151 ms 364 KB Output is correct
14 Correct 153 ms 376 KB Output is correct
15 Correct 150 ms 380 KB Output is correct
16 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 256 KB Output is correct
2 Correct 153 ms 368 KB Output is correct
3 Correct 153 ms 368 KB Output is correct
4 Correct 166 ms 364 KB Output is correct
5 Correct 150 ms 376 KB Output is correct
6 Correct 152 ms 376 KB Output is correct
7 Correct 151 ms 368 KB Output is correct
8 Correct 149 ms 368 KB Output is correct
9 Correct 152 ms 256 KB Output is correct
10 Correct 151 ms 364 KB Output is correct
11 Correct 151 ms 256 KB Output is correct
12 Correct 149 ms 372 KB Output is correct
13 Correct 151 ms 364 KB Output is correct
14 Correct 153 ms 376 KB Output is correct
15 Correct 150 ms 380 KB Output is correct
16 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 256 KB Output is correct
2 Correct 153 ms 368 KB Output is correct
3 Correct 153 ms 368 KB Output is correct
4 Correct 166 ms 364 KB Output is correct
5 Correct 150 ms 376 KB Output is correct
6 Correct 152 ms 376 KB Output is correct
7 Correct 151 ms 368 KB Output is correct
8 Correct 149 ms 368 KB Output is correct
9 Correct 152 ms 256 KB Output is correct
10 Correct 151 ms 364 KB Output is correct
11 Correct 151 ms 256 KB Output is correct
12 Correct 149 ms 372 KB Output is correct
13 Correct 151 ms 364 KB Output is correct
14 Correct 153 ms 376 KB Output is correct
15 Correct 150 ms 380 KB Output is correct
16 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Halted 0 ms 0 KB -