StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
14540162
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-01-26T18:33:30.167
FavoriteCount
0
LastActivityDate
2013-01-26T18:33:30.167
LastEditDate
LastEditorUserId
0
OwnerUserId
1762753
ParentId
14536384
PostTypeId
2
Score
12
ViewCount
0
LastEditorDisplayName
text
Body
Here is my O(k) solution, which is based on the same idea as above, but runs much faster. <pre><code>import os, sys f = open(sys.argv[1], 'r') T = int(f.readline()) def next(ary, start): j = start l = len(ary) ret = start - 1 while j < l and ary[j]: ret = j j += 1 return ret for t in range(T): n, k = map(int, f.readline().strip().split(' ')) a, b, c, r = map(int, f.readline().strip().split(' ')) m = [0] * (4 * k) s = [0] * (k+1) m[0] = a if m[0] <= k: s[m[0]] = 1 for i in xrange(1, k): m[i] = (b * m[i-1] + c) % r if m[i] < k+1: s[m[i]] += 1 p = next(s, 0) m[k] = p + 1 p = next(s, p+2) for i in xrange(k+1, n): if m[i-k-1] > p or s[m[i-k-1]] > 1: m[i] = p + 1 if m[i-k-1] <= k: s[m[i-k-1]] -= 1 s[m[i]] += 1 p = next(s, p+2) else: m[i] = m[i-k-1] if p == k: break if p != k: print 'Case #%d: %d' % (t+1, m[n-1]) else: print 'Case #%d: %d' % (t+1, m[i-k + (n-i+k+k) % (k+1)]) </code></pre> The key point here is, m[i] will never exceeds k, and if we remember the consecutive numbers we can find in previous k numbers from 0 to p, then p will never reduce. If number m[i-k-1] is larger than p, then it's obviously we should set m[i] to p+1, and p will increase at least 1. If number m[i-k-1] is smaller or equal to p, then we should consider whether the same number exists in m[i-k:i], if not, m[i] should set equal to m[i-k-1], if yes, we should set m[i] to p+1 just as the "m[i-k-1]-larger-than-p" case. Whenever p is equal to k, the loop begin, and the loop size is (k+1), so we can jump out of the calculation and print out the answer now.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POMy FB HackerCup code too slow of large inputs
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USzTrix
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POMy FB HackerCup code too slow of large inputs
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.