oj.uz

Submission #29000

# Submission time Handle Problem Language Result Execution time Memory
29000 2017-07-18T05:09:55 Z 윤교준(#1173) Arranging Tickets (JOI17_arranging_tickets) C++11
10 / 100
 2009 ms 3972 KB 
#include <bits/stdc++.h>
#define pb push_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define revv(V) reverse(allv(V))
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
#define MAXN (200005)
#define MAXM (100005)
using namespace std;
typedef long long ll;

int d[MAXN];
int A[MAXM], B[MAXM], C[MAXM];
int N, M;
int Ans = INF;

int main() {
	scanf("%d%d", &N, &M);
	for(int i = 0; i < M; i++) scanf("%d%d%d", &A[i], &B[i], &C[i]);
	for(int i = 0; i < M; i++) { A[i]--; B[i]--; }
	for(int key = 0; key < (1<<M); key++) {
		fill(d, d+N+1, 0);
		for(int i = 0; i < M; i++) {
			if(key & (1<<i)) {
				for(int j = A[i]; j != B[i]; j = (j+1)%N)
					d[j] += C[i];
			} else {
				for(int j = B[i]; j != A[i]; j = (j+1)%N)
					d[j] += C[i];
			}
		}
		int cnt = *max_element(d, d+N);
		upmin(Ans, cnt);
	}
	printf("%d\n", Ans);
	return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:25:23: 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:26:65: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0; i < M; i++) scanf("%d%d%d", &A[i], &B[i], &C[i]);
                                                                 ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1916 ms 3972 KB Output is correct
2 Correct 1943 ms 3972 KB Output is correct
3 Correct 1913 ms 3972 KB Output is correct
4 Correct 1896 ms 3972 KB Output is correct
5 Correct 1899 ms 3972 KB Output is correct
6 Correct 1899 ms 3972 KB Output is correct
7 Correct 1893 ms 3972 KB Output is correct
8 Correct 1913 ms 3972 KB Output is correct
9 Correct 1916 ms 3972 KB Output is correct
10 Correct 1903 ms 3972 KB Output is correct
11 Correct 1863 ms 3972 KB Output is correct
12 Correct 1959 ms 3972 KB Output is correct
13 Correct 1979 ms 3972 KB Output is correct
14 Correct 1956 ms 3972 KB Output is correct
15 Correct 2009 ms 3972 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1916 ms 3972 KB Output is correct
2 Correct 1943 ms 3972 KB Output is correct
3 Correct 1913 ms 3972 KB Output is correct
4 Correct 1896 ms 3972 KB Output is correct
5 Correct 1899 ms 3972 KB Output is correct
6 Correct 1899 ms 3972 KB Output is correct
7 Correct 1893 ms 3972 KB Output is correct
8 Correct 1913 ms 3972 KB Output is correct
9 Correct 1916 ms 3972 KB Output is correct
10 Correct 1903 ms 3972 KB Output is correct
11 Correct 1863 ms 3972 KB Output is correct
12 Correct 1959 ms 3972 KB Output is correct
13 Correct 1979 ms 3972 KB Output is correct
14 Correct 1956 ms 3972 KB Output is correct
15 Correct 2009 ms 3972 KB Output is correct
16 Incorrect 1986 ms 3972 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1916 ms 3972 KB Output is correct
2 Correct 1943 ms 3972 KB Output is correct
3 Correct 1913 ms 3972 KB Output is correct
4 Correct 1896 ms 3972 KB Output is correct
5 Correct 1899 ms 3972 KB Output is correct
6 Correct 1899 ms 3972 KB Output is correct
7 Correct 1893 ms 3972 KB Output is correct
8 Correct 1913 ms 3972 KB Output is correct
9 Correct 1916 ms 3972 KB Output is correct
10 Correct 1903 ms 3972 KB Output is correct
11 Correct 1863 ms 3972 KB Output is correct
12 Correct 1959 ms 3972 KB Output is correct
13 Correct 1979 ms 3972 KB Output is correct
14 Correct 1956 ms 3972 KB Output is correct
15 Correct 2009 ms 3972 KB Output is correct
16 Incorrect 1986 ms 3972 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1916 ms 3972 KB Output is correct
2 Correct 1943 ms 3972 KB Output is correct
3 Correct 1913 ms 3972 KB Output is correct
4 Correct 1896 ms 3972 KB Output is correct
5 Correct 1899 ms 3972 KB Output is correct
6 Correct 1899 ms 3972 KB Output is correct
7 Correct 1893 ms 3972 KB Output is correct
8 Correct 1913 ms 3972 KB Output is correct
9 Correct 1916 ms 3972 KB Output is correct
10 Correct 1903 ms 3972 KB Output is correct
11 Correct 1863 ms 3972 KB Output is correct
12 Correct 1959 ms 3972 KB Output is correct
13 Correct 1979 ms 3972 KB Output is correct
14 Correct 1956 ms 3972 KB Output is correct
15 Correct 2009 ms 3972 KB Output is correct
16 Incorrect 1986 ms 3972 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1916 ms 3972 KB Output is correct
2 Correct 1943 ms 3972 KB Output is correct
3 Correct 1913 ms 3972 KB Output is correct
4 Correct 1896 ms 3972 KB Output is correct
5 Correct 1899 ms 3972 KB Output is correct
6 Correct 1899 ms 3972 KB Output is correct
7 Correct 1893 ms 3972 KB Output is correct
8 Correct 1913 ms 3972 KB Output is correct
9 Correct 1916 ms 3972 KB Output is correct
10 Correct 1903 ms 3972 KB Output is correct
11 Correct 1863 ms 3972 KB Output is correct
12 Correct 1959 ms 3972 KB Output is correct
13 Correct 1979 ms 3972 KB Output is correct
14 Correct 1956 ms 3972 KB Output is correct
15 Correct 2009 ms 3972 KB Output is correct
16 Incorrect 1986 ms 3972 KB Output isn't correct
17 Halted 0 ms 0 KB -